Bøker av Tullio Ceccherini-Silberstein

This unique book provides a self-contained exposition of the theory of cellular automata on groups and explores its deep connections with recent developments in geometric and combinatorial group theory, amenability, symbolic dynamics, the algebraic theory of group rings, and other branches of mathematics and theoretical computer science. The topics treated include the Garden of Eden theorem for amenable groups, the Gromov¿Weiss surjunctivity theorem, and the solution of the Kaplansky conjecture on the stable finiteness of group rings for sofic groups. Entirely self-contained and now in its second edition, the volume includes 10 appendices and more than 600 exercises, the solutions of which are presented in the companion book Exercises in Cellular Automata and Groups (2023) by the same authors. It will appeal to a large audience, including specialists and newcomers to the field.

This book complements the authors' monograph Cellular Automata and Groups [CAG] (Springer Monographs in Mathematics). It consists of more than 600 fully solved exercises in symbolic dynamics and geometric group theory with connections to geometry and topology, ring and module theory, automata theory and theoretical computer science. Each solution is detailed and entirely self-contained, in the sense that it only requires a standard undergraduate-level background in abstract algebra and general topology, together with results established in [CAG] and in previous exercises. It includes a wealth of gradually worked out examples and counterexamples presented here for the first time in textbook form. Additional comments provide some historical and bibliographical information, including an account of related recent developments and suggestions for further reading. The eight-chapter division from [CAG] is maintained. Each chapter begins with a summary of the main definitions and results contained in the corresponding chapter of [CAG]. The book is suitable either for classroom or individual use.Foreword by Rostislav I. Grigorchuk

This monograph adopts an operational and functional analytic approach to the following problem: given a short exact sequence (group extension) 1 N G H 1 of finite groups, describe the irreducible representations of G by means of the structure of the group extension. This problem has attracted many mathematicians, including I. Schur, A.H. Clifford, and G. Mackey and, more recently, M. Isaacs, B. Huppert, Y.G. Berkovich & E.M. Zhmud, and J.M.G. Fell & R.S. Doran.The main topics are, on the one hand, Clifford Theory and the Little Group Method (of Mackey and Wigner) for induced representations, and, on the other hand, Kirillov's Orbit Method (for step-2 nilpotent groups of odd order) which establishes a natural and powerful correspondence between Lie rings and nilpotent groups. As an application, a detailed description is given of the representation theory of the alternating groups, of metacyclic, quaternionic, dihedral groups, and of the (finite) Heisenberg group. The Little Group Method may be applied if and only if a suitable unitary 2-cocycle (the Mackey obstruction) is trivial. To overcome this obstacle, (unitary) projective representations are introduced and corresponding Mackey and Clifford theories are developed. The commutant of an induced representation and the relative Hecke algebra is also examined. Finally, there is a comprehensive exposition of the theory of projective representations for finite Abelian groups which is applied to obtain a complete description of the irreducible representations of finite metabelian groups of odd order.

This monograph is the first comprehensive treatment of multiplicity-free induced representations of finite groups as a generalization of finite Gelfand pairs.

This book presents a self-contained exposition of the theory of cellular automata on groups and explores its deep connections with recent developments in geometric group theory and other branches of mathematics and theoretical computer science.

The representation theory of the symmetric groups is a classical topic that, since the pioneering work of Frobenius, Schur and Young, has grown into a huge body of theory, with many important connections to other areas of mathematics and physics. This self-contained book provides a detailed introduction to the subject, covering classical topics such as the Littlewood-Richardson rule and the Schur-Weyl duality. Importantly the authors also present many recent advances in the area, including Lassalle's character formulas, the theory of partition algebras, and an exhaustive exposition of the approach developed by A. M. Vershik and A. Okounkov. A wealth of examples and exercises makes this an ideal textbook for graduate students. It will also serve as a useful reference for more experienced researchers across a range of areas, including algebra, computer science, statistical mechanics and theoretical physics.

Line up a deck of 52 cards on a table. Randomly choose two cards and switch them. How many switches are needed in order to mix up the deck? Starting from a few concrete problems such as random walks on the discrete circle and the finite ultrametric space this book develops the necessary tools for the asymptotic analysis of these processes. This detailed study culminates with the case-by-case analysis of the cut-off phenomenon discovered by Persi Diaconis. This self-contained text is ideal for graduate students and researchers working in the areas of representation theory, group theory, harmonic analysis and Markov chains. Its topics range from the basic theory needed for students new to this area, to advanced topics such as the theory of Green's algebras, the complete analysis of the random matchings, and the representation theory of the symmetric group.