Chainlink Polytopes and Ehrhart-Equivalence
Combinatorics
2025-04-08 v1
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.
Keywords
Cite
@article{arxiv.2211.08382,
title = {Chainlink Polytopes and Ehrhart-Equivalence},
author = {Ezgi Kantarcı Oğuz and Cem Yalım Özel and Mohan Ravichandran},
journal= {arXiv preprint arXiv:2211.08382},
year = {2025}
}
Comments
21 pages, 7 figures