Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Cellular automata were introduced in the first half of the last century by John von Neumann who used them as theoretical models for self-reproducing machines. The authors present a self-contained exposition of the theory of cellular automata on groups and explore its deep connections with recent developments in geometric group theory, symbolic dynamics, and other branches of mathematics and theoretical computer science. The topics treated include in particular the Garden of Eden theorem for amenable groups, and the Gromov-Weiss surjunctivity theorem as well as the solution of the Kaplansky conjecture on the stable finiteness of group rings for sofic groups. The volume is entirely self-contained, with 10 appendices and more than 300 exercises, and appeals to a large audience including specialists as well as newcomers in the field. It provides a comprehensive account of recent progress in the theory of cellular automata based on the interplay between amenability, geometric and combinatorial group theory, symbolic dynamics and the algebraic theory of group rings which are treated here for the first time in book form.

Cellular automata. --- Computational complexity. --- Electronic books. -- local. --- Cellular automata --- Group theory --- Computational complexity --- Mathematics --- Physical Sciences & Mathematics --- Algebra --- Calculus --- Computers, Iterative circuit --- Iterative circuit computers --- Structures, Tessellation (Automata) --- Tessellation structures (Automata) --- Complexity, Computational --- Computer science. --- Computer logic. --- Algebra. --- Dynamics. --- Ergodic theory. --- Computer Science. --- Logics and Meanings of Programs. --- Dynamical Systems and Ergodic Theory. --- Ergodic transformations --- Continuous groups --- Mathematical physics --- Measure theory --- Transformations (Mathematics) --- Dynamical systems --- Kinetics --- Mechanics, Analytic --- Force and energy --- Mechanics --- Physics --- Statics --- Mathematical analysis --- Computer science logic --- Logic, Symbolic and mathematical --- Informatics --- Science --- Parallel processing (Electronic computers) --- Pattern recognition systems --- Sequential machine theory --- Electronic data processing --- Machine theory --- Logic design. --- Differentiable dynamical systems. --- Differential dynamical systems --- Dynamical systems, Differentiable --- Dynamics, Differentiable --- Differential equations --- Global analysis (Mathematics) --- Topological dynamics --- Design, Logic --- Design of logic systems --- Digital electronics --- Electronic circuit design --- Logic circuits --- Switching theory --- Group theory.

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

Cellular automata were introduced in the first half of the last century by John von Neumann who used them as theoretical models for self-reproducing machines. The authors present a self-contained exposition of the theory of cellular automata on groups and explore its deep connections with recent developments in geometric group theory, symbolic dynamics, and other branches of mathematics and theoretical computer science. The topics treated include in particular the Garden of Eden theorem for amenable groups, and the Gromov-Weiss surjunctivity theorem as well as the solution of the Kaplansky conjecture on the stable finiteness of group rings for sofic groups. The volume is entirely self-contained, with 10 appendices and more than 300 exercises, and appeals to a large audience including specialists as well as newcomers in the field. It provides a comprehensive account of recent progress in the theory of cellular automata based on the interplay between amenability, geometric and combinatorial group theory, symbolic dynamics and the algebraic theory of group rings which are treated here for the first time in book form.

Logic --- Algebra --- Ergodic theory. Information theory --- Mathematics --- Classical mechanics. Field theory --- Computer science --- Computer. Automation --- algebra --- computers --- programmeren (informatica) --- wiskunde --- dynamica --- informatietheorie

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

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.

Symmetry groups --- Representations of groups --- Groupes symétriques --- Représentations de groupes --- Groupes symétriques --- Représentations de groupes --- Symmetry groups. --- Representations of groups. --- Groupes de symétrie --- Groupes de symétrie. --- Représentations de groupes. --- Groupes de symétrie. --- Représentations de groupes.

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

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.

Harmonic analysis. --- Finite groups. --- Groups, Finite --- Group theory --- Modules (Algebra) --- Analysis (Mathematics) --- Functions, Potential --- Potential functions --- Banach algebras --- Calculus --- Mathematical analysis --- Mathematics --- Bessel functions --- Fourier series --- Harmonic functions --- Time-series analysis

Choose an application

• Reference Manager
• EndNote
• RefWorks (Direct export to RefWorks)

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.

Group theory --- wiskunde