Related papers: Classification of Convex lattice polytopes

Short and transparent proofs of central limit theorems for intrinsic volumes of random polytopes in smooth convex bodies are presented. They combine different tools such as estimates for floating bodies with Stein's method from probability…

Let $N$ be a lattice of rank $n$ and let $M = N^{\vee}$ be its dual lattice. In this note we show that given two compact, bounded, full-dimensional convex sets $K_1 \subseteq K_2 \subseteq M_{\R} \coloneqq M \otimes_{\Z} \R$, there is a…

We study solvable lattice models associated to canonical Grothendieck polynomials and their duals. We derive inversion relations and Cauchy identities.

In this paper, we give an overview of some results concerning best and random approximation of convex bodies by polytopes. We explain how both are linked and see that random approximation is almost as good as best approximation.

A biconvex polytope is a classical and tropical convex hull of finitely many points. Given a biconvex polytope, for each vertex of it we construct a directed bigraph and a gammoid so that the collection of base polytopes of those gammoids…

In this paper, we consider polynomials associated with faces and internal quadrilaterals of a cuboctahedron and classify them under the requirement that they are consistent. These polynomials give rise to a system of partial difference…

We characterize all possible relative positions between a hyperboloid of one sheet and a sphere through the roots of a characteristic polynomial associated to these quadrics. The classification is also suitable for a hyperboloid and a…

We prove explicit bounds on the number of lattice points on or near a convex curve in terms of geometric invariants such as length, curvature, and affine arclength. In several of our results we obtain the best possible constants. Our…

The goal of this paper is to study convex lattice sets by the discrete Legendre transform. The definition of the polar of convex lattice sets in $\mathbb{Z}^n$ is provided. It is worth mentioning that the polar of convex lattice sets have…

The contact polytope of a lattice is the convex hull of its shortest vectors. In this paper we classify the facets of the contact polytope of the Leech lattice up to symmetry. There are 1,197,362,269,604,214,277,200 many facets in 232…

The aim of this paper is to study lattice-like coverings with congruent translation balls and the packings and coverings with a type of translation cylinders in Sol space related to the fundamental lattices. We introduce the notions of the…

We discuss the polynomial representation for long knots and elaborate on how to obtain them with a bound on degrees of the defining polynomials, for any knot-type.

If $P$ is a lattice polytope (that is, the convex hull of a finite set of lattice points in $\mathbf{R}^n$), then every sum of $h$ lattice points in $P$ is a lattice point in the $h$-fold sumset $hP$. However, a lattice point in the…

In this paper subvarieties of pseudocomplemented distributive lattices are classified by their unification type. We determine the unification type of every particular unification problem in each subvariety of pseudocomplemented distributive…

In this paper we state a full classification for Coxeter polytopes in $\mathbb{H}^{n}$ with $n+3$ facets which are non-compact and have precisely one non-simple vertex.

In this note, we derive an asymptotically sharp upper bound on the number of lattice points in terms of the volume of centrally symmetric convex bodies. Our main tool is a generalization of a result of Davenport that bounds the number of…

In this paper, we obtain a complete classification of compact hyperbolic Coxeter five-dimensional polytopes with nine facets.

We study three families of polyhedral cones whose sections are regular simplices, cubes, and crosspolytopes. We compute solid angles and conic intrinsic volumes of these cones. We show that several quantities appearing in stochastic…

We introduce two classes of discrete polynomials and construct discrete equations admitting a Lax representation in terms of these polynomials. Also we give an approach which allows to construct lattice integrable hierarchies in its…

Many (if not most) of convex polytopes, important for combinatorial and algebraic geometry, are closely related to secondary polytopes of point configurations, or base polytopes of submodular functions, or their numerous variations and…