The focus of algorithmic group theory shifted from the decidability/undecidability type of result to the complexity of algorithms. This title contains papers that reflect that paradigm shift. It presents articles that are based on the AMS/ASL Joint Special Session, Interactions Between Logic, Group Theory and Computer Science.
Discusses, from a working mathematician's point of view, the mystery of mathematical intuition: Why are certain mathematical concepts more intuitive than others? And to what extent does the 'small scale' structure of mathematical concepts and algorithms reflect the workings of the human brain?
Since the pioneering works of Novikov and Maltsev, group theory has been a testing ground for mathematical logic in its many manifestations, from the theory of algorithms to model theory. The interaction between logic and group theory led to many prominent results which enriched both disciplines. This volume reflects the major themes of the American Mathematical Society/Association for Symbolic Logic Joint Special Session (Baltimore, MD), Interactions between Logic, Group Theory and Computer Science. Included are papers devoted to the development of techniques used for the interaction of group theory and logic. It is suitable for graduate students and researchers interested in algorithmic and combinatorial group theory. A complement to this work is Volume 349 in the AMS series, Contemporary Mathematics, Computational and Experimental Group Theory, which arose from the same meeting and concentrates on the interaction of group theory and computer science.
Matroids appear in diverse areas of mathematics, from combinatorics to algebraic topology and geometry, and "Coxeter Matroids" provides an intuitive and interdisciplinary treatment of their theory. In this text, matroids are examined in terms of symmetric and finite reflection groups; also, symplectic matroids and the more general coxeter matroids are carefully developed. The Gelfand-Serganova theorem, which allows for the geometric interpretation of matroids as convex polytopes with certain symmetry properties, is presented, and in the final chapter, matroid representations and combinatorial flag varieties are discussed. With its excellent bibliography and index and ample references to current research, this work will be useful for graduate students and research mathematicians.
This graduate/advanced undergraduate textbook contains a systematic and elementary treatment of finite groups generated by reflections. The approach is based on fundamental geometric considerations in Coxeter complexes, and emphasizes the intuitive geometric aspects of the theory of reflection groups. Key features include: many important concepts in the proofs are illustrated in simple drawings, which give easy access to the theory; a large number of exercises at various levels of difficulty; some Euclidean geometry is included along with the theory of convex polyhedra; no prerequisites are necessary beyond the basic concepts of linear algebra and group theory; and a good index and bibliography The exposition is directed at advanced undergraduates and first-year graduate students.
The book gives a detailed presentation of the classification of the simple groups of finite Morley rank which contain a nontrivial unipotent 2-subgroup. They are linear algebraic groups over algebraically closed fields of characteristic 2. Although the story told in the book is inspired by the classification of the finite simple groups, it goes well beyond this source of inspiration. Not only do the techniques adapted from finite group theory cover, in a peculiar way, various portions of the three generations of approaches to finite simple groups but model theoretic methods also play an unexpected role. The book contains a complete account of all this material, part of which has not been published. In addition, almost every general result about groups of finite Morley rank is exposed in detail and the book ends with a chapter where the authors provide a list of open problems in the relevant fields of mathematics. As a result, the book provides food for thought to finite group theorists, model theorists, and algebraic geometers who are interested in group theoretic problems.
The book is devoted to the theory of groups of finite Morley rank. These groups arise in model theory and generalize the concept of algebraic groups over algebraically closed fields. The book contains almost all the known results in the subject. Trying to attract pure group theorists in thesubject and to prepare the graduate student to start the research in the area, the authors adopted an algebraic and self evident point of view rather than a model theoretic one, and developed the theory from scratch. All the necessary model theoretical and group theoretical notions are explained inlength. The book is full of exercises and examples and one of its chapters contains a discussion of open problems and a program for further research.
Discusses, from a working mathematician's point of view, the mystery of mathematical intuition: Why are certain mathematical concepts more intuitive than others? And to what extent does the 'small scale' structure of mathematical concepts and algorithms reflect the workings of the human brain?
The focus of algorithmic group theory shifted from the decidability/undecidability type of result to the complexity of algorithms. This title contains papers that reflect that paradigm shift. It presents articles that are based on the AMS/ASL Joint Special Session, Interactions Between Logic, Group Theory and Computer Science.
Since the pioneering works of Novikov and Maltsev, group theory has been a testing ground for mathematical logic in its many manifestations, from the theory of algorithms to model theory. The interaction between logic and group theory led to many prominent results which enriched both disciplines. This volume reflects the major themes of the American Mathematical Society/Association for Symbolic Logic Joint Special Session (Baltimore, MD), Interactions between Logic, Group Theory and Computer Science. Included are papers devoted to the development of techniques used for the interaction of group theory and logic. It is suitable for graduate students and researchers interested in algorithmic and combinatorial group theory. A complement to this work is Volume 349 in the AMS series, Contemporary Mathematics, Computational and Experimental Group Theory, which arose from the same meeting and concentrates on the interaction of group theory and computer science.
Matroids appear in diverse areas of mathematics, from combinatorics to algebraic topology and geometry, and "Coxeter Matroids" provides an intuitive and interdisciplinary treatment of their theory. In this text, matroids are examined in terms of symmetric and finite reflection groups; also, symplectic matroids and the more general coxeter matroids are carefully developed. The Gelfand-Serganova theorem, which allows for the geometric interpretation of matroids as convex polytopes with certain symmetry properties, is presented, and in the final chapter, matroid representations and combinatorial flag varieties are discussed. With its excellent bibliography and index and ample references to current research, this work will be useful for graduate students and research mathematicians.
This graduate/advanced undergraduate textbook contains a systematic and elementary treatment of finite groups generated by reflections. The approach is based on fundamental geometric considerations in Coxeter complexes, and emphasizes the intuitive geometric aspects of the theory of reflection groups. Key features include: many important concepts in the proofs are illustrated in simple drawings, which give easy access to the theory; a large number of exercises at various levels of difficulty; some Euclidean geometry is included along with the theory of convex polyhedra; no prerequisites are necessary beyond the basic concepts of linear algebra and group theory; and a good index and bibliography The exposition is directed at advanced undergraduates and first-year graduate students.
Thank you for visiting our website. Would you like to provide feedback on how we could improve your experience?
This site does not use any third party cookies with one exception — it uses cookies from Google to deliver its services and to analyze traffic.Learn More.