Related papers: The surface of a lattice polytope

We consider the number of configurations of a surface in two dimensions that has a prescribed length and encloses a prescribed perimeter with respect to a baseline. An approximate analytical treatment in a semi--continuum compares…

A lattice $(d,k)$-polytope is the convex hull of a set of points in $\mathbb{R}^d$ whose coordinates are integers ranging between $0$ and $k$. We consider the smallest possible distance $\varepsilon(d,k)$ between two disjoint lattice…

In this note, we given a version of Pick's theorem for the simple lattice polygon in two-dimensional subspace of R^3.

We express the generating function for lattice points in a rational polyhedral cone with a simplicial subdivision in terms of multivariate analogues of the h-polynomials of the subdivision and "local contributions" of the links of its…

We give an explicit construction, based on Hadamard matrices, for an infinite series of floor{sqrt{d}/2}-neighborly centrally symmetric d-dimensional polytopes with 4d vertices. This appears to be the best explicit version yet of a recent…

We apply tropical geometry to study the image of a map defined by Laurent polynomials with generic coefficients. If this image is a hypersurface then our approach gives a construction of its Newton polytope.

We generalize an inequality for convex lattice polygons -- aka toric surfaces -- to general rational surfaces.

Starting from any finite simple graph, one can build a reflexive polytope known as a symmetric edge polytope. The first goal of this paper is to show that symmetric edge polytopes are intrinsically matroidal objects: more precisely, we…

We introduce the property of convex normality of rational polytopes and give a dimensionally uniform lower bound for the edge lattice lengths, guaranteeing the property. As an application, we show that if every edge of a lattice d-polytope…

After giving a short introduction on smooth lattice polytopes, I will present a proof for the finiteness of smooth lattice polytopes with few lattice points. The argument is then turned into an algorithm for the classification of smooth…

Let $P$ be a polytope with rational vertices. A classical theorem of Ehrhart states that the number of lattice points in the dilations $P(n) = nP$ is a quasi-polynomial in $n$. We generalize this theorem by allowing the vertices of P(n) to…

We give an algorithm that constructs the Hasse diagram of the face lattice of a convex polytope P from its vertex-facet incidences in time O(min{n,m}*a*f), where n is the number of vertices, m is the number of facets, a is the number of…

We show that the number of lattice points in the boundary of a positive integer dilate of a Delzant integral polytope is a polynomial in the dilation parameter, analogous to the Ehrhart polynomial giving the number of lattice points in a…

We classify all the possible $delta$-vectors of d-dimensional integral convex polytopes whose volumes are less than or equal to 3/(d!).

The purpose of this note is to give an (esentially optimal) effective version of Matsusaka's Big theorem for smooth projective surfaces.

We consider a rational elliptic surface with a relatively minimal fibration. We compute the number of integral sections in the above rational elliptic surface. As an application, we obtain an estimate of polynomial solutions of some…

We develop a method to obtain the general solution of the Laplace equation in $d$-dimension in ultraspherical coordinates.

We consider 2-surfaces arising from the Korteweg de Vries (KdV) equation. The surfaces corresponding to KdV are in a three dimensional Minkowski space. They contain a family of quadratic Weingarten and Willmore-like surfaces. We show that a…

A lattice polytope translated by a rational vector is called an almost integral polytope. In this paper we investigate Ehrhart quasi-polynomials of almost integral polytopes. We study the relationship between the shape of the polytopes and…

We exhibit large families of K3 surfaces with real multiplication, both abstractly using lattice theory, the Torelli theorem and the surjectivity of the period map, as well as explicitly using dihedral covers and isogenies.