Lattice simplices of maximal dimension with a given degree

DOI10.1307/MMJ/1548817531MaRDI QIDQ2286799zbMATH OpenOpenAlexWikidataFDO

Authors Akihiro Higashitani

Publication date 22 January 2020

Published in Michigan Mathematical Journal (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1605.00273

zbMATH Keywords

binary simplex codesCayley conjecturedegreelattice simplices

Mathematics Subject Classification ID

Toric varieties, Newton polyhedra, Okounkov bodies (14M25) Lattice polytopes in convex geometry (including relations with commutative algebra and algebraic geometry) (52B20) Linear codes (general theory) (94B05)

Abstract: It was proved by Nill that for any lattice simplex of dimension $d$ with degree $s$ which is not a lattice pyramid, the inequality $d+1leq4s-1$ holds. In this paper, we give a complete characterization of lattice simplices satisfying the equality, i.e., the lattice simplices of dimension $(4s-2)$ with degree $s$ which are not lattice pyramids. It turns out that such simplices arise from binary simplex codes. As an application of this characterization, we show that such simplices are counterexamples for the conjecture known as "Cayley conjecture". Moreover, by modifying Nill's inequaitly slightly, we also see the sharper bound $d+1leqf(2s)$, where $f(M)=su{m}_{n=0}^{lfloorlo{g}_{2}Mfloor}lfloorM/2^{n}floor$ for $Minmathbb{Z}_{geq0}$. We also observe that any lattice simplex attaining this sharper bound always comes from a binary code.

Review text

Motivated by the problem of classifying \textit{lattice polytopes}, that is, convex polytopes all of whose vertices lie in the integer lattice \(\mathbb{Z}^d\), with respect to natural parameters, the author studies the relationship of the dimension \(d\) of such a polytope \(P \subseteq \mathbb{R}^d\) and its \textit{degree} \(s\). The parameter \(s\) is just the degree of the \textit{\(h^*\)-polynomial} \(h^*_P(t)\) of \(P\), defined by the well-known generating function identity \[ \sum_{n \geq 0} |nP \cap \mathbb{Z}^d| \, t^n = \frac{h^*_P(t)}{(1-t)^{d+1}}. \] The starting point of the paper is a result of \textit{B. Nill} [Eur. J. Comb. 29, No. 7, 1596--1602 (2008; Zbl 1149.52013)] who proved that the dimension of a lattice \textit{simplex} that is not a lattice pyramid and whose degree is at most \(s\) is upper bounded by \(4s-2\). The main result of the paper is a characterization of the extremal lattice simplices in this statement: A lattice simplex of degree \(s\) and dimension \(4s-2\) that is not a lattice pyramid is unimodularly equivalent to the simplex \(\Delta(r+2)\), where \(s=2^r\), \(r \in \mathbb{Z}_{\geq0}\), and where \(\Delta(r+2)\) is uniquely determined by \(r\) and the so-called \((r+2)\)-dimensional \textit{binary simplex code}. As a further insight the simplices \(\Delta(r+2)\) are shown to be counterexamples to what was known as the \textit{Cayley conjecture} -- a structural statement on the decomposition of a lattice polytope whose degree is smaller than half its dimension. A modified conjecture is offered for future studies. The arguments in the proofs crucially rely on a characterization due to \textit{V. Batyrev} and \textit{J. Hofscheier} [``Lattice polytopes, finite abelian subgroups in $\mathrm{SL}(n,\mathbb{C})$ and coding theory, Preprint, \url{arXiv:1309.5312}] of lattice simplices that are not lattice pyramids in terms of an associated finite abelian group.

Recommendations

• scientific article; zbMATH DE number 5155408
• Lattice polytopes having \(h^*\)-polynomials with given degree and linear coefficient
• Universal conditions on \(h^*\)-vectors of lattice simplices
• On the maximal width of empty lattice simplices
• Cayley decompositions of lattice polytopes and upper bounds for h^ *-polynomials

Cites work

• A generalization of a theorem of White
• A simple combinatorial criterion for projective toric manifolds with dual defect
• Algebro-geometric characterization of Cayley polytopes
• Cayley decompositions of lattice polytopes and upper bounds for h^ *-polynomials
• Computing the Continuous Discretely
• Lattice polytopes having \(h^*\)-polynomials with given degree and linear coefficient
• Multiples of lattice polytopes without interior lattice points
• Polyhedral adjunction theory

Cited in

(6)

• Ehrhart polynomials of lattice polytopes with normalized volumes 5
• Universal conditions on \(h^*\)-vectors of lattice simplices
• Cayley decompositions of lattice polytopes and upper bounds for h^ *-polynomials
• Fine polyhedral adjunction theory
• Smith normal forms of graphical Hermite simplices
• Lattice polytopes having \(h^*\)-polynomials with given degree and linear coefficient

This page was built for publication: Lattice simplices of maximal dimension with a given degree

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2286799)