Publication:2217991: Difference between revisions

From MaRDI portal
Publication:2217991
Created automatically from import240129110113
 
(No difference)

Latest revision as of 03:11, 2 February 2024

DOI10.3842/SIGMA.2020.130zbMATH Open1461.05240arXiv1907.09337MaRDI QIDQ2217991FDOQ2217991

Sam Hopkins

Publication date: 12 January 2021

Published in: SIGMA. Symmetry, Integrability and Geometry: Methods and Applications (Search for Journal in Brave)

Abstract: The cyclic sieving phenomenon of Reiner, Stanton, and White says that we can often count the fixed points of elements of a cyclic group acting on a combinatorial set by plugging roots of unity into a polynomial related to this set. One of the most impressive instances of the cyclic sieving phenomenon is a theorem of Rhoades asserting that the set of plane partitions in a rectangular box under the action of promotion exhibits cyclic sieving. In Rhoades's result the sieving polynomial is the size generating function for these plane partitions, which has a well-known product formula due to MacMahon. We extend Rhoades's result by also considering symmetries of plane partitions: specifically, complementation and transposition. The relevant polynomial here is the size generating function for symmetric plane partitions, whose product formula was conjectured by MacMahon and proved by Andrews and Macdonald. Finally, we explain how these symmetry results also apply to the rowmotion operator on plane partitions, which is closely related to promotion.


Full work available at URL: https://arxiv.org/abs/1907.09337

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)





Cites Work


Cited In (16)

Uses Software






This page was built for publication: Cyclic sieving for plane partitions and symmetry

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2217991)