Advertisement

Young Tableaux and Combinatorial Enumeration in Parallel Processing

Chapter
  • 219 Downloads
Part of the Mathematics and Its Applications book series (MAIA, volume 292)

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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Kluwer Academic Publishers 1994

Personalised recommendations