Search arXivSearch

arXiv · 2608.16037

Counting Lattice Points in Minkowski Sums of Cross Polytopes

Abstract

Motivated by Postnikov's study of lattice-point enumeration in Minkowski sums of simplices, we investigate lattice points in Minkowski sums of cross polytopes and establish analogous results, together with several related consequences. In particular, we introduce the support-enumerator associated with Postnikov's notion of draconian sequences and show that it coincides with the $h^*$-polynomial of the corresponding root polytope. This provides a new interpretation of the $h^*$-polynomial and yields a simple method for computing the volume of the corresponding polytope. By exploiting the symmetry of these root polytopes, we further establish a duality property for support-enumerators, which in turn provides a proof of a conjecture by Athanasiadis and Chapoton concerning the $h$-polynomials of preorders. Consequently, we obtain a formula for the number of lattice points in Minkowski sums of cross polytopes in terms of draconian sequences and show that these polytopes are Ehrhart positive. Furthermore, this formula leads to analogous expressions for the number of lattice points on their boundaries and for their surface volumes.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Ziyi Dai, Qilin Hou, Zhiyuan Liu, Warut Thawinrak, Hongyu Wang. 2026-08-27. Counting Lattice Points in Minkowski Sums of Cross Polytopes. https://arxiv.org/abs/2608.16037

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Rooted Spider Embeddings and the Erd\H os-Sós Conjecture

Under a local density condition, we prove that every $k$-edge spider embeds at any prescribed center of degree at least $k$, unless all legs are even and the host graph has one of two specified structures. These structures contain complete bipartite subgraphs with prescribed neighborhoods. The proof uses path rerouting and three exchange lemmas that describe equality in neighborhood estimates. As a consequence, we recover the Erd\H os-Sós bound for all spiders.

math.CO

Generalized Goulden-Yong duals and signed minimal factorizations

In this paper, we give two combinatorial ways to study signed exceptional sequences. First, we show the equivalence between one-way reflections and relatively projective representations. Secondly, we construct generalized Goulden-Yong duals using reverse Garside element actions and folded chord diagrams. We then give two applications of the generalized Goulden-Yong duals: constructing generalized Prüfer codes and counting signed factorizations using the matrix-tree theorem.

math.CO

Explicit expressions for iterates of power series

We present several formulas for both the discrete and fractional iterates of an invertible power series $f$, using a new unifying approach based on umbral calculus. Known formulas are extended, and their proofs simplified, while new expressions are introduced. In particular, by employing $q$-calculus identities, we eliminate the requirement for $f'(0)$ to equal $1$ and the resulting general expressions for the iterative logarithm are obtained as well.

math.CO