The Representation Theory of the Symmetric Group provides an account of both the ordinary and modular representation theory of the symmetric groups. The range of applications of this theory is vast, varying from theoretical physics, through combinatories to the study of polynomial identity algebras; and new uses are still being found.

This book brings together many of the important results in this field. From the reviews: ""A classic gets even better....The edition has new material including the Novelli-Pak-Stoyanovskii bijective proof of the hook formula, Stanley’s proof of the sum of squares formula using differential posets, Fomin’s bijective proof of the sum of squares formula, group acting on posets and their use in proving unimodality, and chromatic symmetric functions." --ZENTRALBLATT MATH

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.

The representation theory of symmetric groups is one of the most beautiful, popular and important parts of algebra, with many deep relations to other areas of mathematics. Kleshchev describes a new approach to the subject, based on the recent work of Lascoux, Leclerc, Thibon, Ariki, Grojnowski and Brundan, as well as his own

An introduction to the modern representation theory of big groups, exploring its connections to probability and algebraic combinatorics.

This book provides an accessible introduction to the state of the art of representation theory of finite groups. Starting from a basic level that is summarized at the start, the book proceeds to cover topics of current research interest, including open problems and conjectures. The central themes of the book are block theory and module theory of group representations, which are comprehensively surveyed with a full bibliography. The individual chapters cover a range of topics within the subject, from blocks with cyclic defect groups to representations of symmetric groups. Assuming only modest background knowledge at the level of a first graduate course in algebra, this guidebook, intended for students taking first steps in the field, will also provide a reference for more experienced researchers. Although no proofs are included, end-of-chapter exercises make it suitable for student seminars.