Young Tableaux and Combinatorial Enumeration in Parallel Processing
- 219 Downloads
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.
Unable to display preview. Download preview PDF.