2000 character limit reached
Chainlink Polytopes and Ehrhart-Equivalence (2211.08382v1)
Published 15 Nov 2022 in math.CO
Abstract: We introduce a class of polytopes that we call chainlink polytopes and which allow us to construct infinite families of pairs of non isomorphic rational polytopes with the same Ehrhart quasi-polynomial. Our construction is based on circular fence posets, which admit a non-obvious and non-trivial symmetry in their rank sequences that turns out to be reflected in the polytope level. We introduce the related class of chainlink posets and show that they exhibit the same symmetry properties. We further prove an outstanding conjecture on the unimodality of circular rank polynomials.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.