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

This book is intended to present group representation theory at a level accessible to mature undergraduate students and beginning graduate students. This is achieved by mainly keeping the required background to the level of undergraduate linear algebra, group theory and very basic ring theory. Module theory and Wedderburn theory, as well as tensor products, are deliberately avoided. Instead, we take an approach based on discrete Fourier Analysis. Applications to the spectral theory of graphs are given to help the student appreciate the usefulness of the subject. A number of exercises are included. This book is intended for a 3rd/4th undergraduate course or an introductory graduate course on group representation theory. However, it can also be used as a reference for workers in all areas of mathematics and statistics.

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