Search arXivSearch

arXiv · 2606.18794

Ehrhart Theory of the Join of Two Lattice Polytopes

Abstract

Inspired by research on the Cartesian product of two lattice polytopes, this paper investigates the Ehrhart theory of the join of two lattice polytopes. This is also a well-known open problem listed on the website of the American Institute of Mathematics. This paper resolves this open problem. We first construct counterexamples showing that the join of two Ehrhart positive polytopes is not necessarily Ehrhart positive. Then we prove that if two lattice polytopes have the integer decomposition property and the spanning property, then their join also has these two properties. However, the very ample property is not inherited under joins. Finally, we show that unimodular triangulations, regular triangulations, and quadratic triangulations are preserved under the join operation. As a byproduct, we state the necessary and sufficient condition for the Cartesian product of two Gorenstein lattice polytopes to remain Gorenstein.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Feihu Liu, Sihao Tao, Guoce Xin. 2026-06-17. Ehrhart Theory of the Join of Two Lattice Polytopes. https://arxiv.org/abs/2606.18794

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