Related papers: Projecting lattice polytopes according to the Mini…

Let $X$ be a finite set in $Z^d$. We consider the problem of optimizing linear function $f(x) = c^T x$ on $X$, where $c\in Z^d$ is an input vector. We call it a problem $X$. A problem $X$ is related with linear program $\max\limits_{x \in…

We prove a lower bound theorem for the number of $k$-faces ($1\le k\le d-2$) in a $d$-dimensional polytope $P$ (or $d$-polytope) with up to $3d-1$ vertices. Previous lower bound theorems for $d$-polytopes with few vertices concern those…

This paper gives a description of various recent results which construct monomial ideals with a given minimal free resolution. We show that these are all instances of coordinatizing a finite atomic lattice as defined by Mapes. Subsequently,…

In this paper we show that the spectrum of the Q-codegree of a d-dimensional lattice polytope is finite above any positive threshold in the class of lattice polytopes with \alpha-canonical normal fan for any fixed \alpha>0. For \alpha=1/r…

In the hierarchy of structural sophistication for lattice polytopes, normal polytopes mark a point of origin; very ample and Koszul polytopes occupy bottom and top spots in this hierarchy, respectively. In this paper we explore a simple…

We classify the three-dimensional lattice polytopes with two interior lattice points. Up to unimodular equivalence there are 22,673,449 such polytopes. This classification allows us to verify, for this case only, a conjectural upper bound…

Given lattice polytopes $P_1, \ldots, P_k$ contained in a $k$-dimensional subspace $U \subseteq \mathbb{R}^d$ and a $d$-dimensional lattice polytope $Q \subset \mathbb{R}^d$, we compute the Hodge vector of the Cayley polytope $P_1 * \cdots…

Let $K \subseteq \mathbb{R}^d$ be a convex body and let $\mathbf{w} \in \operatorname{int}(K)$ be an interior point of $K$. The coefficient of asymmetry $\operatorname{ca}(K,\mathbf{w}) := \min\{ \lambda \geq 1 : \mathbf{w} - K \subseteq…

A perfect matching in an undirected graph $G=(V,E)$ is a set of vertex disjoint edges from $E$ that include all vertices in $V$. The perfect matching problem is to decide if $G$ has such a matching. Recently Rothvo{\ss} proved the striking…

Let d>2 and let p be a prime coprime to d. Let Z_pbar be the ring of integers of Q_pbar. Suppose f(x) is a degree-d polynomial over Qbar and Z_pbar. Let P be a prime ideal over p in the ring of integers of Q(f), where Q(f) is the number…

For a polytope P a simplex S with vertex set V(S) is called a special simplex if every facet of P contains all but exactly one vertex of S. For such polytopes P with face complex F(P) containing a special simplex the subcomplex F(P) / V(S)…

Let A be a subset of positive relative upper density of P^d, the d-tuples of primes. We prove that A contains an affine copy of any finite set of lattice points E, as long as E is in general position in the sense that it has at most one…

Let $X_{P}$ be the projective toric surface associated to a lattice polytope $P$. If the number of lattice points lying on the boundary of $P$ is at least $4$, it is known that $X_{P}$ is embeddable into a suitable projective space as zero…

Polytope theory has produced a great number of remarkably simple and complete characterization results for face-number sets or f-vector sets of classes of polytopes. We observe that in most cases these sets can be described as the…

Let $B_Y$ denote the unit ball of a normed linear space $Y$. A symmetric, bounded, closed, convex set $A$ in a finite dimensional normed linear space $X$ is called a {\it sufficient enlargement} for $X$ if, for an arbitrary isometric…

Let $F$ be an infinite field and let $f$ be a nonzero multilinear polynomial with coefficients in $F$. We prove that for every positive integer $d$ there exists a positive integer $s$ such that $f(M_{s}(F))$, the image of $f$ in $M_{s}(F)$,…

We study the set of square-free parts of volume polynomials associated with four planar lattice polytopes. This is motivated by the problem of describing possible pairwise intersection numbers of four curves in $(\mathbb{C}^*)^2$ with…

For a minimal inequality derived from a maximal lattice-free simplicial polytope in $\R^n$, we investigate the region where minimal liftings are uniquely defined, and we characterize when this region covers $\R^n$. We then use this…

Consider a lattice in a real finite dimensional vector space. Here, we are interested in the lattice polytopes, that is the convex hulls of finite subsets of the lattice. Consider the group $G$ of the affine real transformations which map…

A projective scheme $X$ is called `quadratic' if $X$ is scheme-theoretically cut out by homogeneous equations of degree 2. Furthermore, we say $X$ satisfies `property $\textbf{N}_{2,p}$' if it is quadratic and the quadratic ideal has only…