Repository logo
Log in(current)
Repository logoMIT Open ScholarshipDSpace@MIT
  1. Home
  2. MIT Open Access Articles
  3. MIT Open Access Articles
  4. Unimodality of partitions with distinct parts inside Ferrers shapes

Unimodality of partitions with distinct parts inside Ferrers shapes

Thumbnail Image
Download
Name

Stanley_Unimodality of partitions.pdf

Size

157.45 KB

Format

Adobe PDF

Checksum (MD5)

0ccf8e66890f5a9ed554e4d30deb76c0

Download all files submitted through automated deposit
sword-2017-10-27.original.zip (150.72 KB)
Author(s)
Zanello, Fabrizio
•
Stanley, Richard P
Date Issued
April 2015
Journal
European Journal of Combinatorics
Publisher
Elsevier
Citation
Stanley, Richard P., and Zanello, Fabrizio. “Unimodality of Partitions with Distinct Parts Inside Ferrers Shapes.” European Journal of Combinatorics 49 (October 2015): 194–202 © 2015 Elsevier
Version
Author's final manuscript
Abstract
We investigate the rank-generating function F[subscript λ] of the poset of partitions contained inside a given shifted Ferrers shape λ. When λ has four parts, we show that F [subscript λ] is unimodal when λ=〈n, n-1, n-2, n-3〉, for any n≥4, and that unimodality fails for the doubly-indexed, infinite family of partitions of the form λ=〈n, n-t, n-2t, n-3t〉, for any given t≥2 and n large enough with respect to t.When λ has b≤3 parts, we show that our rank-generating functions F[subscript λ] are all unimodal. However, the situation remains mostly obscure for b≥5. In general, the type of results that we obtain present some remarkable similarities with those of the 1990 paper of D. Stanton, who considered the case of partitions inside ordinary (straight) Ferrers shapes. Along the way, we also determine some interesting q-analogs of the binomial coefficients, which in certain instances we conjecture to be unimodal. We state several other conjectures throughout this note, in the hopes to stimulate further work in this area. In particular, one of these will attempt to place into a much broader context the unimodality of the posets M(n) of staircase partitions, for which determining a combinatorial proof remains an outstanding open problem.
MIT Department
Massachusetts Institute of Technology. Department of Mathematics
Terms of Use
Creative Commons Attribution-NonCommercial-NoDerivs License
http://creativecommons.org/licenses/by-nc-nd/4.0/
Persistent DSpace Link
http://hdl.handle.net/1721.1/112204
DOI of Published Version
https://doi.org/10.1016/J.EJC.2015.03.007
Repository logo
PrivacyPermissionsAccessibilityContact us
Repository logo
Notify us about copyright concerns.