Representation Theory, Dynamical Systems, and Asymptotic Combinatorics

Representation Theory, Dynamical Systems, and Asymptotic Combinatorics
Author: V. Kaimanovich
Publisher: American Mathematical Soc.
Total Pages: 258
Release: 2011-11-09
Genre: Mathematics
ISBN: 0821872893

This volume, devoted to the 70th birthday of the well-known St. Petersburg mathematician A. M. Vershik, contains a collection of articles by participants in the conference "Representation Theory, Dynamical Systems, and Asymptotic Combinatorics", held in St. Petersburg in June of 2004. The book is suitable for graduate students and researchers interested in combinatorial and dynamical aspects of group representation theory.

Asymptotic Combinatorics with Applications to Mathematical Physics

Asymptotic Combinatorics with Applications to Mathematical Physics
Author: European Mathematical Summer School (2001 : St. Petersburg)
Publisher: Springer Science & Business Media
Total Pages: 245
Release: 2003
Genre: Asymptotic expansions
ISBN: 3540403124

At the Summer School Saint Petersburg 2001, the main lecture courses bore on recent progress in asymptotic representation theory: those written up for this volume deal with the theory of representations of infinite symmetric groups, and groups of infinite matrices over finite fields; Riemann-Hilbert problem techniques applied to the study of spectra of random matrices and asymptotics of Young diagrams with Plancherel measure; the corresponding central limit theorems; the combinatorics of modular curves and random trees with application to QFT; free probability and random matrices, and Hecke algebras.

Representation Theory, Dynamical Systems, and Asymptotic Combinatorics

Representation Theory, Dynamical Systems, and Asymptotic Combinatorics
Author: V. Kaimanovich
Publisher:
Total Pages: 258
Release: 2011
Genre:
ISBN: 9781470418243

This volume, devoted to the 70th birthday of the well-known St. Petersburg mathematician A.M. Vershik, contains a collection of articles by participants in the conference "Representation Theory, Dynamical Systems, and Asymptotic Combinatorics", held in St. Petersburg in June of 2004. The book is suitable for graduate students and researchers interested in combinatorial and dynamical aspects of group representation theory.

Self-Similar Groups

Self-Similar Groups
Author: Volodymyr Nekrashevych
Publisher: American Mathematical Soc.
Total Pages: 248
Release: 2005
Genre: Mathematics
ISBN: 0821838318

Self-similar groups (groups generated by automata) initially appeared as examples of groups that are easy to define but have exotic properties like nontrivial torsion, intermediate growth, etc. This book studies the self-similarity phenomenon in group theory and shows its intimate relationship with dynamical systems and more classical self-similar structures, such as fractals, Julia sets, and self-affine tilings. This connection is established through the central topics of the book, which are the notions of the iterated monodromy group and limit space. A wide variety of examples and different applications of self-similar groups to dynamical systems and vice versa are discussed. In particular, it is shown that Julia sets can be reconstructed from the respective iterated monodromy groups and that groups with exotic properties can appear not just as isolated examples, but as naturally defined iterated monodromy groups of rational functions. The book offers important, new mathematics that will open new avenues of research in group theory and dynamical systems. It is intended to be accessible to a wide readership of professional mathematicians.

Combinatorics, Automata and Number Theory

Combinatorics, Automata and Number Theory
Author: Valérie Berthé
Publisher: Cambridge University Press
Total Pages: 637
Release: 2010-08-12
Genre: Mathematics
ISBN: 0521515971

This series is devoted to significant topics or themes that have wide application in mathematics or mathematical science and for which a detailed development of the abstract theory is less important than a thorough and concrete exploration of the implications and applications. Books in the Encyclopedia of Mathematics and its Applications cover their subjects comprehensively. Less important results may be summarised as exercises at the ends of chapters, For technicalities, readers can be referred to the bibliography, which is expected to be comprehensive. As a result, volumes are encyclopedic references or manageable guides to major subjects.

Analytic Combinatorics

Analytic Combinatorics
Author: Philippe Flajolet
Publisher: Cambridge University Press
Total Pages: 825
Release: 2009-01-15
Genre: Mathematics
ISBN: 1139477161

Analytic combinatorics aims to enable precise quantitative predictions of the properties of large combinatorial structures. The theory has emerged over recent decades as essential both for the analysis of algorithms and for the study of scientific models in many disciplines, including probability theory, statistical physics, computational biology, and information theory. With a careful combination of symbolic enumeration methods and complex analysis, drawing heavily on generating functions, results of sweeping generality emerge that can be applied in particular to fundamental structures such as permutations, sequences, strings, walks, paths, trees, graphs and maps. This account is the definitive treatment of the topic. The authors give full coverage of the underlying mathematics and a thorough treatment of both classical and modern applications of the theory. The text is complemented with exercises, examples, appendices and notes to aid understanding. The book can be used for an advanced undergraduate or a graduate course, or for self-study.

Representation Theory, Dynamical Systems, and Asymptotic Combinatorics

Representation Theory, Dynamical Systems, and Asymptotic Combinatorics
Author: Vadim A. Kaimanovich
Publisher: American Mathematical Soc.
Total Pages: 264
Release: 2006-01-01
Genre: Mathematics
ISBN: 9780821890714

This volume, devoted to the 70th birthday of the well-known St. Petersburg mathematician A. M. Vershik, contains a collection of articles by participants in the conference ''Representation Theory, Dynamical Systems, and Asymptotic Combinatorics'', held in St. Petersburg in June of 2004. The book is suitable for graduate students and researchers interested in combinatorial and dynamical aspects of group representation theory.

Asimptoti?eskaja teorija predstavlenija simmetri?eskoj gruppyi ee primenenija v analize

Asimptoti?eskaja teorija predstavlenija simmetri?eskoj gruppyi ee primenenija v analize
Author: Sergei Vasilʹevich Kerov
Publisher: American Mathematical Soc.
Total Pages: 224
Release:
Genre: Mathematics
ISBN: 9780821889633

This book reproduces the doctoral thesis written by a remarkable mathematician, Sergei V. Kerov. His untimely death at age 54 left the mathematical community with an extensive body of work and this one-of-a-kind monograph. Here, he gives a clear and lucid account of results and methods of asymptotic representation theory. The book is a unique source of information on an important topic of current research. Asymptotic representation theory of symmetric groups deals with problems of two types: asymptotic properties of representations of symmetric groups of large order and representations of the limiting object, i.e., the infinite symmetric group. The author contributed significantly in the development of both directions. His book presents an account of these contributions, as well as those of other researchers. Among the problems of the first type, the author discusses the properties of the distribution of the normalized cycle length in a random permutation and the limiting shape of a random (with respect to the Plancherel measure) Young diagram. He also studies stochastic properties of the deviations of random diagrams from the limiting curve. Among the problems of the second type, Kerov studies an important problem of computing irreducible characters of the infinite symmetric group. This leads to the study of a continuous analog of the notion of Young diagram, and in particular, to a continuous analogue of the hook walk algorithm, which is well known in the combinatorics of finite Young diagrams. In turn, this construction provides a completely new description of the relation between the classical moment problems of Hausdorff and Markov. The book is suitable for graduate students and research mathematicians interested in representation theory and combinatorics.

Combinatorial Stochastic Processes

Combinatorial Stochastic Processes
Author: Jim Pitman
Publisher: Springer Science & Business Media
Total Pages: 257
Release: 2006-05-11
Genre: Mathematics
ISBN: 354030990X

The purpose of this text is to bring graduate students specializing in probability theory to current research topics at the interface of combinatorics and stochastic processes. There is particular focus on the theory of random combinatorial structures such as partitions, permutations, trees, forests, and mappings, and connections between the asymptotic theory of enumeration of such structures and the theory of stochastic processes like Brownian motion and Poisson processes.