This volume contains seventeen of the best papers delivered at the SIGMAP Workshop 2014, representing the most recent advances in the field of symmetries of discrete objects and structures, with a particular emphasis on connections between maps, Riemann surfaces and dessins d’enfant.Providing the global community of researchers in the field with the opportunity to gather, converse and present their newest findings and advances, the Symmetries In Graphs, Maps, and Polytopes Workshop 2014 was the fifth in a series of workshops. The initial workshop, organized by Steve Wilson in Flagstaff, Arizona, in 1998, was followed in 2002 and 2006 by two meetings held in Aveiro, Portugal, organized by Antonio Breda d’Azevedo, and a fourth workshop held in Oaxaca, Mexico, organized by Isabel Hubard in 2010.This book should appeal to both specialists and those seeking a broad overview of what is happening in the area of symmetries of discrete objects and structures.iv>
5th SIGMAP Workshop, West Malvern, UK, July 2014
Author: Jozef Širáň,Robert Jajcay
Applications of Group Theory to Combinatorics contains 11 survey papers from international experts in combinatorics, group theory and combinatorial topology. The contributions cover topics from quite a diverse spectrum, such as design theory, Belyi functions, group theory, transitive graphs, regular maps, and Hurwitz problems, and present the state-of-the-art in these areas. Applications of Group Theory to Combinatorics will be useful in the study of graphs, maps and polytopes having maximal symmetry, and is aimed at researchers in the areas of group theory and combinatorics, graduate students in mathematics, and other specialists who use group theory and combinatorics. Jack Koolen teaches at the Department of Mathematics at Pohang University of Science and Technology, Korea. His main research interests include the interaction of geometry, linear algebra and combinatorics, on which he published 60 papers. Jin Ho Kwak is Professor at the Department of Mathematics at Pohang University of Science and Technology, Korea, where he is director of the Combinatorial and Computational Mathematics Center (Com2MaC). He works on combinatorial topology, mainly on covering enumeration related to Hurwitz problems and regular maps on surfaces, and published more than 100 papers in these areas. Ming-Yao Xu is Professor in Department of Mathematics at Peking University, China. The focus in his research is in finite group theory and algebraic graph theory. Ming-Yao Xu published over 80 papers on these topics.
Author: Jack Koolen,Jin Ho Kwak,Ming-Yao Xu
Publisher: CRC Press
This book consists of contributions from experts, presenting a fruitful interplay between different approaches to discrete geometry. Most of the chapters were collected at the conference “Geometry and Symmetry” in Veszprém, Hungary from 29 June to 3 July 2015. The conference was dedicated to Károly Bezdek and Egon Schulte on the occasion of their 60th birthdays, acknowledging their highly regarded contributions in these fields. While the classical problems of discrete geometry have a strong connection to geometric analysis, coding theory, symmetry groups, and number theory, their connection to combinatorics and optimization has become of particular importance. The last decades have seen a revival of interest in discrete geometric structures and their symmetry. The rapid development of abstract polytope theory has resulted in a rich theory featuring an attractive interplay of methods and tools from discrete geometry, group theory and geometry, combinatorial group theory, and hyperbolic geometry and topology. This book contains papers on new developments in these areas, including convex and abstract polytopes and their recent generalizations, tiling and packing, zonotopes, isoperimetric inequalities, and on the geometric and combinatorial aspects of linear optimization. The book is a valuable resource for researchers, both junior and senior, in the field of discrete geometry, combinatorics, or discrete optimization. Graduate students find state-of-the-art surveys and an open problem collection.
Dedicated to Károly Bezdek and Egon Schulte on the Occasion of Their 60th Birthdays
Author: Marston D. E. Conder,Antoine Deza,Asia Ivić Weiss
The last decade has seen two parallel developments, one in computer science, the other in mathematics, both dealing with the same kind of combinatorial structures: networks with strong symmetry properties or, in graph-theoretical language, vertex-transitive graphs, in particular their prototypical examples, Cayley graphs. In the design of large interconnection networks it was realised that many of the most fre quently used models for such networks are Cayley graphs of various well-known groups. This has spawned a considerable amount of activity in the study of the combinatorial properties of such graphs. A number of symposia and congresses (such as the bi-annual IWIN, starting in 1991) bear witness to the interest of the computer science community in this subject. On the mathematical side, and independently of any interest in applications, progress in group theory has made it possible to make a realistic attempt at a complete description of vertex-transitive graphs. The classification of the finite simple groups has played an important role in this respect.
Algebraic Methods and Applications
Author: Gena Hahn,Gert Sabidussi
Publisher: Springer Science & Business Media
This book contains the successful invited submissions to a Special Issue of Symmetry on the subject of “Graph Theory”. Although symmetry has always played an important role in Graph Theory, in recent years, this role has increased significantly in several branches of this field, including but not limited to Gromov hyperbolic graphs, the metric dimension of graphs, domination theory, and topological indices. This Special Issue includes contributions addressing new results on these topics, both from a theoretical and an applied point of view.
Author: Jose M. Rodriguez
This book contains recent contributions to the fields of rigidity and symmetry with two primary focuses: to present the mathematically rigorous treatment of rigidity of structures and to explore the interaction of geometry, algebra and combinatorics. Contributions present recent trends and advances in discrete geometry, particularly in the theory of polytopes. The rapid development of abstract polytope theory has resulted in a rich theory featuring an attractive interplay of methods and tools from discrete geometry, group theory, classical geometry, hyperbolic geometry and topology. Overall, the book shows how researchers from diverse backgrounds explore connections among the various discrete structures with symmetry as the unifying theme. The volume will be a valuable source as an introduction to the ideas of both combinatorial and geometric rigidity theory and its applications, incorporating the surprising impact of symmetry. It will appeal to students at both the advanced undergraduate and graduate levels, as well as post docs, structural engineers and chemists.
Author: Robert Connelly,Asia Ivić Weiss,Walter Whiteley
Among the participants discussing recent trends in their respective fields and in areas of common interest in these proceedings are such world-famous geometers as H.S.M. Coxeter, L. Danzer, D.G. Larman and J.M. Wills, and equally famous graph-theorists B. Bollobás, P. Erdös and F. Harary. In addition to new results in both geometry and graph theory, this work includes articles involving both of these two fields, for instance ``Convexity, Graph Theory and Non-Negative Matrices'', ``Weakly Saturated Graphs are Rigid'', and many more. The volume covers a broad spectrum of topics in graph theory, geometry, convexity, and combinatorics. The book closes with a number of abstracts and a collection of open problems raised during the conference.
Author: M. Rosenfeld,J. Zaks
The LNCS series reports state-of-the-art results in computer science research, development, and education, at a high level and in both printed and electronic form. Enjoying tight cooperation with the R&D community, with numerous individuals, as well as with prestigious organizations and societies, LNCS has grown into the most comprehensive computer science research forum available. The scope of LNCS, including its subseries LNAI and I.NBI, spans the whole range of computer science and information technology including interdisciplinary topics in a variety of application fields. The type of material published traditionally includes ûproceedings (published in time for the respective conference) ûpost-proceedings (consisting of thoroughly revised final full papers) ûresearch monographs (which may be based on outstanding PhD work, research projects, technical reports, etc.) More recently, several color-cover sublines have been added featuring, beyond a collection of papers, various added-value components; these sublines include -tutorials (textbook-like monographs or collections of lectures given at advanced courses) -state-of-the-art surveys (offering complete and mediated coverage of a topic) -hot topics (introducing emergent topics to the broader community)
14th International Conference, IPCO 2010, Lausanne, Switzerland, June 9-11, 2010, Proceedings
Author: Friedrich Eisenbrand,Bruce Shepherd
Publisher: Springer Science & Business Media
Foremost book available on polytopes, incorporating ancient Greek and most modern work. Discusses polygons, polyhedrons, and multi-dimensional polytopes. Definitions of symbols. Includes 8 tables plus many diagrams and examples. 1963 edition.
Author: H. S. M. Coxeter
Publisher: Courier Corporation
A modern, comprehensive review of abstract regular polytopes.
Author: Peter McMullen,Egon Schulte
Publisher: Cambridge University Press
Author: Branko Grünbaum
Category: Convex polytopes
a collection of essays
Author: Karl Heinrich Hofmann,Rudolf Wille
Proceedings of the International Conference on Knot Theory and Related Topics Held in Osaka (Japan), August 15-19, 1990
Author: Akio Kawauchi
Publisher: Walter de Gruyter
Author: G. B. Dantzig
Category: Business & Economics
Convexity is a simple idea that manifests itself in a surprising variety of places. This fertile field has an immensely rich structure and numerous applications. Barvinok demonstrates that simplicity, intuitive appeal, and the universality of applications make teaching (and learning) convexity a gratifying experience. The book will benefit both teacher and student: It is easy to understand, entertaining to the reader, and includes many exercises that vary in degree of difficulty. Overall, the author demonstrates the power of a few simple unifying principles in a variety of pure and applied problems. The prerequisites are minimal amounts of linear algebra, analysis, and elementary topology, plus basic computational skills. Portions of the book could be used by advanced undergraduates. As a whole, it is designed for graduate students interested in mathematical methods, computer science, electrical engineering, and operations research. The book will also be of interest to research mathematicians, who will find some results that are recent, some that are new, and many known results that are discussed from a new perspective.
Author: Alexander Barvinok
Publisher: American Mathematical Soc.
Category: Combinatorial analysis
Author: M. I. Samoĭlovich,A. Talis
Category: Technology & Engineering