Search arXivSearch

arXiv · 1501.01055

Lattice 3-polytopes with six lattice points

Abstract

We classify lattice $3$-polytopes of width larger than one and with exactly $6$ lattice points. We show that there are $74$ polytopes of width $2$, two polytopes of width $3$, and none of larger width. We give explicit coordinates for representatives of each class, together with other invariants such as their oriented matroid (or order type) and volume vector. For example, according to the number of interior points these $76$ polytopes divide into $23$ tetrahedra with two interior points (clean tetrahedra), $49$ polytopes with one interior point (the $49$ canonical three-polytopes with five boundary points previously classified by Kasprzyk) and only $4$ hollow polytopes. We also give a complete classification of three-polytopes of width one with $6$ lattice points. In terms of the oriented matroid of these six points, they lie in eight infinite classes and twelve individual polytopes. Our motivation comes partly from the concept of distinct pair sum (or dps) polytopes, which, in dimension $3$, can have at most $8$ lattice points. Among the $74+2$ classes mentioned above, exactly $44 + 1$ are dps.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Mónica Blanco, Francisco Santos. 2015-01-06. Lattice 3-polytopes with six lattice points. https://doi.org/10.1137/15m1014462

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