Related papers: Bounds on Area Involving Lattice Size

We prove upper bounds on the graph diameters of polytopes in two settings. The first is a worst-case bound for polytopes defined by integer constraints in terms of the height of the integers and certain subdeterminants of the constraint…

Let $P$ be a convex polygon in ${\mathbb C}$ and let $\Delta_{D, P}$ be the operator of the Dirichlet boundary value problem for the Lapalcian $\Delta=-4\partial_z\partial_{\bar z}$ in $P$. We derive a variational formula for the logarithm…

A new approach of implementing initial and boundary conditions for the lattice Boltzmann method is presented. The new approach is based on an extended collision operator that uses the gradients of the fluid velocity. The numerical…

We prove a sharp bound for the remainder term of the number of lattice points inside a ball, when averaging over a compact set of (not necessarily unimodular) lattices, in dimensions two and three. We also prove that such a bound cannot…

We study widths of conjugacy classes in anisotropic higher rank $S$-arithmetic groups of orthogonal type. Assuming the GRH, we prove that many such groups have bounded conjugacy width. For example, this holds if the degree is greater or…

In this paper we consider metric fillings of convex bodies. We show that convex bodies $C\subset \mathbb{R}^n$ are the unique minimal fillings of their boundary metrics among all integral current spaces. To this end, we also prove that…

In this paper, we consider the discrete fourth-order Schr\"{o}dinger equation on the lattice $h\mathbb{Z}^2$. Uniform Strichartz estimates are established by analyzing frequency localized oscillatory integrals with the method of stationary…

A polygon is \textit{small} if it has unit diameter. The maximal area of a small polygon with a fixed number of sides $n$ is not known when $n$ is even and $n\geq14$. We determine an improved lower bound for the maximal area of a small…

A simple convex lattice polytope $\Box$ defines a torus-equivariant line bundle $\LB$ over a toric variety $\XB.$ Atiyah and Bott's Lefschetz fixed-point theorem is applied to the torus action on the $d''$-complex of $\LB$ and information…

We consider planar curved strictly convex domains with no or very weak smoothness assumptions and prove sharp bounds for square-functions associated to the lattice point discrepancy.

The simplex was conjectured to be the extremal convex body for the two following "problems of asymmetry":\\ P1) What is the minimal possible value of the quantity $\max_{K'} |K'|/|K|$? Here, $K'$ ranges over all symmetric convex bodies…

We give a simple and complete description of those convex lattice polygons in the plane that can be dissected into lattice triangles of integer area. A new version of Sperner's Lemma plays a central role.

We prove sharp upper bounds on the volume and the number of lattice points on edges of higher-dimensional reflexive simplices. These convex-geometric results are derived from new number-theoretic bounds on the denominators of unit fractions…

We study inequalities that simultaneously relate the number of lattice points, the volume and the successive minima of a convex body to one another. One main ingredient in order to establish these relations is Blaschke's shaking procedure,…

Branched polymers can be classified into two categories that obey the different formulae: \begin{equation} \nu= \begin{cases} \hspace{1mm}\displaystyle\frac{2(1+\nu_{0})}{d+2} & \hspace{3mm}\mbox{for polymers…

In this work, we determine a sharp upper bound on the orthogonality defect of HKZ reduced bases up to dimension $3$. Using this result, we determine a general upper bound for the orthogonality defect of HKZ reduced bases of arbitrary rank.…

A self-avoiding polygon is a lattice polygon consisting of a closed self-avoiding walk on a square lattice. Surprisingly little is known rigorously about the enumeration of self-avoiding polygons, although there are numerous conjectures…

It is a widely observed phenomenon in computer graphics that the size of the silhouette of a polyhedron is much smaller than the size of the whole polyhedron. This paper provides, for the first time, theoretical evidence supporting this for…

We investigate minimal-perimeter configurations of two finite sets of points on the square lattice. This corresponds to a lattice version of the classical double-bubble problem. We give a detailed description of the fine geometry of…

Ellingsrud and Peskine (1989) proved that there exists a bound on the degree of smooth non general type surfaces in P^4. The latest proven bound is 52 by Decker and Schreyer in 2000. In this paper we consider bounds on the degree of a…