Abstract
Simion has a conjecture concerning the number of lattice paths in a rectangular grid with the Ferrers diagram of a partition removed. The conjecture concerns the unimodality of a sequence of these numbers where the sum of the length and width of each rectangle is a constant and where the partition is constant. This paper demonstrates this unimodality if the partition is self-conjugate or if the Ferrers diagram of the partition has precisely one column or one row. This paper also shows log concavity for partitions of “staircase” shape via a Reflection Principle argument.
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.
