A recursion of the Pólya polynomial for the symmetric group
A recursion for the Pólya polynomial of the symmetric group is proved. This recursion will be used to compute the Pólya polynomial of the Young group. In turn, a theorem by George Pólya, generalized by deBruijn, will be used to compute the double cosets of Young groups embedded in an overall symmetric group. Connections to mathematical physics and combinatorics will be noted but not proved.
Year of publication: |
2010
|
---|---|
Authors: | Pletsch, Bill |
Published in: |
Mathematics and Computers in Simulation (MATCOM). - Elsevier, ISSN 0378-4754. - Vol. 80.2010, 6, p. 1212-1220
|
Publisher: |
Elsevier |
Subject: | Pólya | Computer algebra | Double cosets | Recursion |
Saved in:
Saved in favorites
Similar items by subject
-
Recursive random variables with subgaussian distributions
Neininger, Ralph, (2005)
-
A Recursive Value for n -Person Cooperative Games
Salonen, Hannu, (2006)
-
Моделирование конвейерных бизнес-процессов
ВАСИЛЬЕВИЧ, КУПРИЯНОВ БОРИС, (2010)
- More ...