Abstract
Given n > 0, S in , the symmetric group is the group of permutations of n symbols. Equivalently, the group of one-to-one mappings on a set of cardinality n. The composition of mappings provides the group law. Here we will discuss the basic features of the sym- metric groups and their representation theory. Some applications including MacMahon’s Master Theorem and Molien’s Theorem will be presented.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Rights and permissions
Copyright information
© 1994 Kluwer Academic Publishers
About this chapter
Cite this chapter
(1994). Young Tableaux and Combinatorial Enumeration in Parallel Processing. In: Algebraic Structures and Operator Calculus. Mathematics and Its Applications, vol 292. Springer, Dordrecht. https://doi.org/10.1007/978-0-585-28003-5_6
Download citation
DOI: https://doi.org/10.1007/978-0-585-28003-5_6
Publisher Name: Springer, Dordrecht
Print ISBN: 978-0-7923-2921-3
Online ISBN: 978-0-585-28003-5
eBook Packages: Springer Book Archive