Show simple item record

dc.contributor.authorDugan, William T.
dc.contributor.authorHegarty, Maura
dc.contributor.authorMorales, Alejandro H.
dc.contributor.authorRaymond, Annie
dc.date.accessioned2025-10-16T21:30:01Z
dc.date.available2025-10-16T21:30:01Z
dc.date.issued2024-12-09
dc.identifier.urihttps://hdl.handle.net/1721.1/163195
dc.description.abstractIn 1999, Pitman and Stanley introduced the polytope bearing their name along with a study of its faces, lattice points, and volume. The Pitman–Stanley polytope is well-studied due to its connections to probability, parking functions, the generalized permutahedra, and flow polytopes. Its lattice points correspond to plane partitions of skew shape with entries 0 and 1. Pitman and Stanley remarked that their polytope can be generalized so that lattice points correspond to plane partitions of skew shape with entries 0 , 1 , … , m . Since then, this generalization has been untouched. We study this generalization and show that it can also be realized as a flow polytope of a grid graph. We give multiple characterizations of its vertices in terms of plane partitions of skew shape and integer flows. For a fixed skew shape, we show that the number of vertices of this polytope is a polynomial in m whose leading term, in certain cases, counts standard Young tableaux of a skew shifted shape. Moreover, we give formulas for the number of faces, as well as generating functions for the number of vertices.en_US
dc.publisherSpringer USen_US
dc.relation.isversionofhttps://doi.org/10.1007/s00454-024-00704-3en_US
dc.rightsArticle is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.en_US
dc.sourceSpringer USen_US
dc.titleGeneralized Pitman–Stanley Polytope: Vertices and Facesen_US
dc.typeArticleen_US
dc.identifier.citationDugan, W.T., Hegarty, M., Morales, A.H. et al. Generalized Pitman–Stanley Polytope: Vertices and Faces. Discrete Comput Geom 74, 492–543 (2025).en_US
dc.contributor.departmentMassachusetts Institute of Technology. Operations Research Centeren_US
dc.relation.journalDiscrete & Computational Geometryen_US
dc.eprint.versionAuthor's final manuscripten_US
dc.type.urihttp://purl.org/eprint/type/JournalArticleen_US
eprint.statushttp://purl.org/eprint/status/PeerRevieweden_US
dc.date.updated2025-10-08T14:58:08Z
dc.language.rfc3066en
dc.rights.holderThe Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature
dspace.embargo.termsY
dspace.date.submission2025-10-08T14:58:08Z
mit.journal.volume74en_US
mit.licensePUBLISHER_POLICY
mit.metadata.statusAuthority Work and Publication Information Neededen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record