Extremal Problems in Graph Homomorphisms and Vertex Identifications
Author : Daniel Pritikin
Publisher :
Page : 200 pages
File Size : 38,20 MB
Release : 1984
Category : Extremal problems (Mathematics)
ISBN :
Author : Daniel Pritikin
Publisher :
Page : 200 pages
File Size : 38,20 MB
Release : 1984
Category : Extremal problems (Mathematics)
ISBN :
Author :
Publisher :
Page : 610 pages
File Size : 40,9 MB
Release : 1985-03
Category : Dissertations, Academic
ISBN :
Author :
Publisher :
Page : 768 pages
File Size : 12,97 MB
Release : 1990
Category : Dissertation abstracts
ISBN :
Author :
Publisher :
Page : 1016 pages
File Size : 18,4 MB
Release : 1989
Category : Dissertations, Academic
ISBN :
Author : American Mathematical Society
Publisher :
Page : 1028 pages
File Size : 34,47 MB
Release : 1985
Category : Electronic journals
ISBN :
Contains articles of significant interest to mathematicians, including reports on current mathematical research.
Author : Gena Hahn
Publisher : Springer Science & Business Media
Page : 456 pages
File Size : 45,6 MB
Release : 1997-06-30
Category : Mathematics
ISBN : 9780792346685
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.
Author : Frank Harary
Publisher :
Page : 362 pages
File Size : 40,40 MB
Release : 1969
Category : Mathematics
ISBN :
Author :
Publisher :
Page : 790 pages
File Size : 32,28 MB
Release : 1993
Category : Mathematics
ISBN :
Author : Benson Farb
Publisher : American Mathematical Soc.
Page : 384 pages
File Size : 16,91 MB
Release : 2006-09-12
Category : Mathematics
ISBN : 0821838385
The appearance of mapping class groups in mathematics is ubiquitous. The book presents 23 papers containing problems about mapping class groups, the moduli space of Riemann surfaces, Teichmuller geometry, and related areas. Each paper focusses completely on open problems and directions. The problems range in scope from specific computations, to broad programs. The goal is to have a rich source of problems which have been formulated explicitly and accessibly. The book is divided into four parts. Part I contains problems on the combinatorial and (co)homological group-theoretic aspects of mapping class groups, and the way in which these relate to problems in geometry and topology. Part II concentrates on connections with classification problems in 3-manifold theory, the theory of symplectic 4-manifolds, and algebraic geometry. A wide variety of problems, from understanding billiard trajectories to the classification of Kleinian groups, can be reduced to differential and synthetic geometry problems about moduli space. Such problems and connections are discussed in Part III. Mapping class groups are related, both concretely and philosophically, to a number of other groups, such as braid groups, lattices in semisimple Lie groups, and automorphism groups of free groups. Part IV concentrates on problems surrounding these relationships. This book should be of interest to anyone studying geometry, topology, algebraic geometry or infinite groups. It is meant to provide inspiration for everyone from graduate students to senior researchers.
Author : Jin-yi Cai
Publisher :
Page : pages
File Size : 46,47 MB
Release : 2017
Category : Algebra, Boolean
ISBN : 9781107635609
Complexity theory aims to understand and classify computational problems, especially decision problems, according to their inherent complexity. This book uses new techniques to expand the theory for use with counting problems. The authors present dichotomy classifications for broad classes of counting problems in the realm of P and NP. Classifications are proved for partition functions of spin systems, graph homomorphisms, constraint satisfaction problems, and Holant problems. The book assumes minimal prior knowledge of computational complexity theory, developing proof techniques as needed and gradually increasing the generality and abstraction of the theory. This volume presents the theory on the Boolean domain, and includes a thorough presentation of holographic algorithms, culminating in classifications of computational problems studied in exactly solvable models from statistical mechanics