Hall–Littlewood polynomials and fixed point enumeration

详细信息    查看全文

• 作者：Brendon Rhoades
• 关键词：Hall– ; Littlewood polynomial ; Kostka– ; Foulkes polynomial ; Ribbon tableau ; Plethysm ; Transportation matrix ; Contingency table
• 刊名：Discrete Mathematics
• 出版年：2010
• 出版时间：28 February 2010
• 年：2010
• 卷：310
• 期：4
• 页码：869-876
• 全文大小：507 K

文摘

We resolve affirmatively some conjectures of Reiner, Stanton, and White (2004) [12] regarding enumeration of transportation matrices which are invariant under certain cyclic row and column rotations. Our results are phrased in terms of the bicyclic sieving phenomenon introduced by Barcelo, Reiner, and Stanton (2009) [1]. The proofs of our results use various tools from symmetric function theory such as the Stanton–White rim hook correspondence (Stanton and White (1985) [18]) and results concerning the specialization of Hall–Littlewood polynomials due to Lascoux, Leclerc, and Thibon (1994, 1997) [5] and [6].