A recursion of the Pólya polynomial for the symmetric group

Bill Pletsch

Mathematics and Computers in Simulation (MATCOM), 2010, vol. 80, issue 6, 1212-1220

Abstract: 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.

Keywords: Pólya; Computer algebra; Double cosets; Recursion (search for similar items in EconPapers)
Date: 2010
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0378475408001791
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:matcom:v:80:y:2010:i:6:p:1212-1220

DOI: 10.1016/j.matcom.2008.04.017

Access Statistics for this article

Mathematics and Computers in Simulation (MATCOM) is currently edited by Robert Beauwens

More articles in Mathematics and Computers in Simulation (MATCOM) from Elsevier
Bibliographic data for series maintained by Catherine Liu ().