Representation Theory Dynamical Systems And Asymptotic Combinatorics

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.

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.

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.

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.

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.

This collaborative volume presents trends arising from the fruitful interaction between the themes of combinatorics on words, automata and formal language theory, and number theory. Presenting several important tools and concepts, the authors also reveal some of the exciting and important relationships that exist between these different fields. Topics include numeration systems, word complexity function, morphic words, Rauzy tilings and substitutive dynamical systems, Bratelli diagrams, frequencies and ergodicity, Diophantine approximation and transcendence, asymptotic properties of digital functions, decidability issues for D0L systems, matrix products and joint spectral radius. Topics are presented in a way that links them to the three main themes, but also extends them to dynamical systems and ergodic theory, fractals, tilings and spectral properties of matrices. Graduate students, research mathematicians and computer scientists working in combinatorics, theory of computation, number theory, symbolic dynamics, fractals, tilings and stringology will find much of interest in this book.

Asymptotic Geometric Analysis is concerned with the geometric and linear properties of finite dimensional objects, normed spaces, and convex bodies, especially with the asymptotics of their various quantitative parameters as the dimension tends to infinity. The deep geometric, probabilistic, and combinatorial methods developed here are used outside the field in many areas of mathematics and mathematical sciences. The Fields Institute Thematic Program in the Fall of 2010 continued an established tradition of previous large-scale programs devoted to the same general research direction. The main directions of the program included: * Asymptotic theory of convexity and normed spaces * Concentration of measure and isoperimetric inequalities, optimal transportation approach * Applications of the concept of concentration * Connections with transformation groups and Ramsey theory * Geometrization of probability * Random matrices * Connection with asymptotic combinatorics and complexity theory These directions are represented in this volume and reflect the present state of this important area of research. It will be of benefit to researchers working in a wide range of mathematical sciences—in particular functional analysis, combinatorics, convex geometry, dynamical systems, operator algebras, and computer science.

The Abel Symposia volume at hand contains a collection of high-quality articles written by the world’s leading experts, and addressing all mathematicians interested in advances in deterministic and stochastic dynamical systems, numerical analysis, and control theory. In recent years we have witnessed a remarkable convergence between individual mathematical disciplines that approach deterministic and stochastic dynamical systems from mathematical analysis, computational mathematics and control theoretical perspectives. Breakthrough developments in these fields now provide a common mathematical framework for attacking many different problems related to differential geometry, analysis and algorithms for stochastic and deterministic dynamics. In the Abel Symposium 2016, which took place from August 16-19 in Rosendal near Bergen, leading researchers in the fields of deterministic and stochastic differential equations, control theory, numerical analysis, algebra and random processes presented and discussed the current state of the art in these diverse fields. The current Abel Symposia volume may serve as a point of departure for exploring these related but diverse fields of research, as well as an indicator of important current and future developments in modern mathematics.

This book discusses the representation theory of symmetric groups, the theory of symmetric functions and the polynomial representation theory of general linear groups. The first chapter provides a detailed account of necessary representation-theoretic background. An important highlight of this book is an innovative treatment of the Robinson–Schensted–Knuth correspondence and its dual by extending Viennot's geometric ideas. Another unique feature is an exposition of the relationship between these correspondences, the representation theory of symmetric groups and alternating groups and the theory of symmetric functions. Schur algebras are introduced very naturally as algebras of distributions on general linear groups. The treatment of Schur–Weyl duality reveals the directness and simplicity of Schur's original treatment of the subject. In addition, each exercise is assigned a difficulty level to test readers' learning. Solutions and hints to most of the exercises are provided at the end.