Abstract
We introduce two families of symplectic analogs of the distributive lattices L(m, n). We give several combinatorial descriptions of these distributive lattices and use combinatorial methods to produce their rank generating functions. Using Proctor's sl(2, C) technique, we prove that these symplectic lattices are rank symmetric, rank unimodal, and strongly Sperner. This confirms a conjecture of Reiner and Stanton concerning one of these families of symplectic lattices. We describe how both families of symplectic lattices can be used to explicitly realize the fundamental representations of the symplectic Lie algebras.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: 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.
