Abstract
There is a certain family of Poincaré polynomials that arise naturally in geometry. They satisfy a monotonicity property and admit a combinatorial description in terms of a graded poset whose elements are called Littlewood–Richardson tableaux. The purpose of this article is to give a combinatorial explanation of the monotonicity by exhibiting embeddings of these graded posets. In particular, these posets embed into the cyclage poset of Lascoux and Schützenberger, which was introduced to explain the monotonicity of the Kostka–Foulkes polynomials. The image of the embedding into the cyclage poset is characterized, giving another combinatorial description of the Poincaré polynomials in terms of the catabolizable tableaux defined by the author and J. Weyman.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.