You may have to Search all our reviewed books and magazines, click the sign up button below to create a free account.
This volume contains the proceedings of the AMS Special Session on Algorithmic Problems of Group Theory and Their Complexity, held January 9-10, 2013 in San Diego, CA and the AMS Special Session on Algorithmic Problems of Group Theory and Applications to Information Security, held April 6-7, 2013 at Boston College, Chestnut Hill, MA. Over the past few years the field of group-based cryptography has attracted attention from both group theorists and cryptographers. The new techniques inspired by algorithmic problems in non-commutative group theory and their complexity have offered promising ideas for developing new cryptographic protocols. The papers in this volume cover algorithmic group theory and applications to cryptography.
This volume contains the proceedings of the AMS Special Session on Computational Algebra, Groups, and Applications, held April 30-May 1, 2011, at the University of Nevada, Las Vegas, Nevada, and the AMS Special Session on the Mathematical Aspects of Cryptography and Cyber Security, held September 10-11, 2011, at Cornell University, Ithaca, New York. Over the past twenty years combinatorial and infinite group theory has been energized by three developments: the emergence of geometric and asymptotic group theory, the development of algebraic geometry over groups leading to the solution of the Tarski problems, and the development of group-based cryptography. These three areas in turn have had an impact on computational algebra and complexity theory. The papers in this volume, both survey and research, exhibit the tremendous vitality that is at the heart of group theory in the beginning of the twenty-first century as well as the diversity of interests in the field.
This volume contains the proceedings of three conferences in Ergodic Theory and Symbolic Dynamics: the Oxtoby Centennial Conference, held from October 30–31, 2010, at Bryn Mawr College; the Williams Ergodic Theory Conference, held from July 27–29, 2012, at Williams College; and the AMS Special Session on Ergodic Theory and Symbolic Dynamics, held from January 17–18, 2014, in Baltimore, MD. This volume contains articles covering a variety of topics in measurable, symbolic and complex dynamics. It also includes a survey article on the life and work of John Oxtoby, providing a source of information about the many ways Oxtoby's work influenced mathematical thought in this and other fields.
This book contains surveys and research articles on the state-of-the-art in finitely presented groups for researchers and graduate students. Overviews of current trends in exponential groups and of the classification of finite triangle groups and finite generalized tetrahedron groups are complemented by new results on a conjecture of Rosenberger and an approximation theorem. A special emphasis is on algorithmic techniques and their complexity, both for finitely generated groups and for finite Z-algebras, including explicit computer calculations highlighting important classical methods. A further chapter surveys connections to mathematical logic, in particular to universal theories of various classes of groups, and contains new results on countable elementary free groups. Applications to cryptography include overviews of techniques based on representations of p-groups and of non-commutative group actions. Further applications of finitely generated groups to topology and artificial intelligence complete the volume. All in all, leading experts provide up-to-date overviews and current trends in combinatorial group theory and its connections to cryptography and other areas.
This book is a festschrift in honor of Professor Anthony Gaglione's sixtieth birthday. This volume presents an excellent mix of research and expository articles on various aspects of infinite group theory. The papers give a broad overview of present research in infinite group theory in general, and combinatorial group theory and non-Abelian group-based cryptography in particular. They also pinpoint the interactions between combinatorial group theory and mathematical logic, especially model theory.
Complex analysis is a beautiful subject — perhaps the single most beautiful; and striking; in mathematics. It presents completely unforeseen results that are of a dramatic; even magical; nature. This invaluable book will convey to the student its excitement and extraordinary character. The exposition is organized in an especially efficient manner; presenting basic complex analysis in around 130 pages; with about 50 exercises. The material constantly relates to and contrasts with that of its sister subject; real analysis. An unusual feature of this book is a short final chapter containing applications of complex analysis to Lie theory.Since much of the content originated in a one-semester course given at the CUNY Graduate Center; the text will be very suitable for first year graduate students in mathematics who want to learn the basics of this important subject. For advanced undergraduates; there is enough material for a year-long course or; by concentrating on the first three chapters; for one-semester course.
This volume contains the proceedings of the AMS Special Session on Algebraic and Analytic Aspects of Integrable Systems and Painlevé Equations, held on January 18, 2014, at the Joint Mathematics Meetings in Baltimore, MD. The theory of integrable systems has been at the forefront of some of the most important developments in mathematical physics in the last 50 years. The techniques to study such systems have solid foundations in algebraic geometry, differential geometry, and group representation theory. Many important special solutions of continuous and discrete integrable systems can be written in terms of special functions such as hypergeometric and basic hypergeometric functions. The ana...
This book constitutes the refereed proceedings of the 19th International Conference on Unity of Logic and Computation, CiE 2023, held in Batumi, Georgia, during July 24–28, 2023. The 23 full papers and 13 invited papers included in this book were carefully reviewed and selected from 51 submissions. They were organized in topical sections as follows: Degree theory; Proof Theory; Computability; Algorithmic Randomness; Computational Complexity; Interactive proofs; and Combinatorial approaches.
This research paper continues [15]. We begin with giving a profound overview of the structure of arbitrary simple groups and in particular of the simple locally finite groups and reduce their Sylow theory for the prime p to a quite famous conjecture by Prof. Otto H. Kegel (see [38], Theorem 2.4) "Let the p-subgroup P be a p-uniqueness subgroup in the finite simple group S which belongs to one of the seven rank-unbounded families. Then the rank of S is bounded in terms of P.") about the rank-unbounded ones of the 19 known families of finite simple groups. We introduce a new scheme to describe the 19 families, the family T of types, define the rank of each type, and emphasise the rôle of Kege...
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.