Skip to main content

2001 | Buch | 2. Auflage

The Symmetric Group

Representations, Combinatorial Algorithms, and Symmetric Functions

verfasst von: Bruce E. Sagan

Verlag: Springer New York

Buchreihe : Graduate Texts in Mathematics

insite
SUCHEN

Über dieses Buch

I have been very gratified by the response to the first edition, which has resulted in it being sold out. This put some pressure on me to come out with a second edition and now, finally, here it is. The original text has stayed much the same, the major change being in the treatment of the hook formula which is now based on the beautiful Novelli-Pak-Stoyanovskii bijection (NPS 97]. I have also added a chapter on applications of the material from the first edition. This includes Stanley's theory of differential posets (Stn 88, Stn 90] and Fomin's related concept of growths (Fom 86, Fom 94, Fom 95], which extends some of the combinatorics of Sn-representations. Next come a couple of sections showing how groups acting on posets give rise to interesting representations that can be used to prove unimodality results (Stn 82]. Finally, we discuss Stanley's symmetric function analogue of the chromatic polynomial of a graph (Stn 95, Stn ta]. I would like to thank all the people, too numerous to mention, who pointed out typos in the first edition. My computer has been severely reprimanded for making them. Thanks also go to Christian Krattenthaler, Tom Roby, and Richard Stanley, all of whom read portions of the new material and gave me their comments. Finally, I would like to give my heartfelt thanks to my editor at Springer, Ina Lindemann, who has been very supportive and helpful through various difficult times.

Inhaltsverzeichnis

Frontmatter
Chapter 1. Group Representations
Abstract
We begin our study of the symmetric group by considering its representations. First, however, we must present some general results about group representations that will be useful in our special case. Representation theory can be couched in terms of matrices or in the language of modules. We consider both approaches and then turn to the associated theory of characters. All our work will use the complex numbers as the ground field in order to make life as easy as possible.
Bruce E. Sagan
Chapter 2. Representations of the Symmetric Group
Abstract
In this chapter we construct all the irreducible representations of the symmetric group. We know that the number of such representations is equal to the number of conjugacy classes (Proposition 1.10.1), which in the case of S n is the number of partitions of n. It may not be obvious how to associate an irreducible with each partition λ = (λ1, λ2,...., λl), but it is easy to find a corresponding subgroup S λ that is an isomorphic copy of S λl x Sλ2 x · · · x S λl, inside S n . We can now produce the right number of representations by inducing the trivial representation on each Sλ up to S n .
Bruce E. Sagan
Chapter 3. Combinatorial Algorithms
Abstract
Many results about representations of the symmetric group can be approached in a purely combinatorial manner. The crucial link between these two viewpoints is the fact (Theorem 2.6.5, part 2) that the number of standard Young tableaux of given shape is the degree of the corresponding representation.
Bruce E. Sagan
Chapter 4. Symmetric Functions
Abstract
We have seen how some results about representations of S n , can be proved either by using general facts from representation theory or combinatorially. There is a third approach using symmetric functions, which is our focus in this chapter.
Bruce E. Sagan
Chapter 5. Applications and Generalizations
Abstract
In this chapter we will give some interesting applications and extensions of results found in the rest of the book. Before tackling this material, the reader may find it helpful to review the poset definitions and examples at the beginning of Section 2.2 and Definition 2.5.7.
Bruce E. Sagan
Backmatter
Metadaten
Titel
The Symmetric Group
verfasst von
Bruce E. Sagan
Copyright-Jahr
2001
Verlag
Springer New York
Electronic ISBN
978-1-4757-6804-6
Print ISBN
978-1-4419-2869-6
DOI
https://doi.org/10.1007/978-1-4757-6804-6