a recursion of the pólya polynomial for the symmetric group：一个递归的pólya多项式的对称群.pdfVIP

Available online at Mathematics and Computers in Simulation 80 (2010) 1212–1220 ´ A recursion of the Polya polynomial for the symmetric group Bill Pletsch ∗ Central New Mexico Community College, Mathematics, 525 Buena Vista SE, Albuquerque, NM 87106, USA Received 11 December 2007; received in revised form 24 April 2008; accepted 27 April 2008 Available online 4 May 2008 Abstract ´ ´ A recursion for the Polya polynomial of the symmetric group is proved. This recursion will be used to compute the Polya ´ polynomial of the Young group. In turn, a theorem by George Polya, 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. © 2008 IMACS. Published by Elsevier B.V. All rights reserved. ´ Keywords: Polya; Computer algebra; Double cosets; Recursion 1. Introduction ´ In 1988, in the conclusion to my dissertation [4], I noted without proof, a recursion for the Polya polynomial of the ´ symmetric group. In this paper, the Polya polynomial recursion is proved. The recursion has been useful for my own research in the last few years. It is hoped others will find it of som