The Symmetric Group

Representations, Combinatorial Algorithms and Symmetric Function

Bruce Sagan

238 pages, parution le 01/05/2001 (2^eme édition)

Ajouter à une liste

Indisponible

Résumé

This text is an introduction to the representation theory of the symmetric group from three different points of view: via general representation theory, via combinatorial algorithms, and via symmetric functions. It is the only book to deal with all three aspects of this subject at once. The style of presentation is relaxed yet rigorous and the prerequisites have been kept to a minimum--undergraduate courses in linear algebra and group theory will suffice. And this is a very active area of current research, so the text will appeal to graduate students and mathematicians in other specialties interested in finding out about this field. On the other hand, a number of the combinatorial results presented have never appeared in book form before and so the volume will serve as a good reference for teachers already working in this area. Among these results are Haiman's theory of dual equivalence and the beautiful Novelli-Pak-Stoyanovskii proof of the hook formula (the latter being new to the second edition). In addition, there is a new chapter on applications of materials from the first edition.

Contents

Group Representations
Representations of the Symmetric Group
Combinatorial Algorithms
Symmetric Functions
Applications and Generalizations

L'auteur - Bruce Sagan

Bruce Sagan is Professor of Mathematics at Michigan State University and has authored over 50 papers in combinatorics and its relation to algebra and topology. When he is not proving theorems, he is playing folk music from Scandinavian and the Balkans on the fiddle and its ethnic relatives.

Caractéristiques techniques

	PAPIER
Éditeur(s)	Springer
Auteur(s)	Bruce Sagan
Parution	01/05/2001
Édition	2^eme édition
Nb. de pages	238
Format	16 x 24
Couverture	Relié
Poids	486g
Intérieur	Noir et Blanc
EAN13	9780387950679
ISBN13	978-0-387-95067-9