Related papers: Lattice points in algebraic cross-polytopes and si…

Let $X$ be a list of vectors that is totally unimodular. In a previous article the author proved that every real-valued function on the set of interior lattice points of the zonotope defined by $X$ can be extended to a function on the whole…

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…

The problem of finding the number of lattice points in a triangle has a classical solution if the lattice is $\mathbf{Z}^2$ and the vertices of the triangle have integer valued coordinates. We consider what happens when we replace the…

We describe an algorithm for determining whether two convex polytopes P and Q, embedded in a lattice, are isomorphic with respect to a lattice automorphism. We extend this to a method for determining if P and Q are equivalent, i.e. whether…

We study the Minkowski length L(P) of a lattice polytope P, which is defined to be the largest number of non-trivial primitive segments whose Minkowski sum lies in P. The Minkowski length represents the largest possible number of factors in…

We express the number of lattice points inside certain simplices via Dedekind-Rademacher sums. As an application, we prove a conjecture of Kronheimer and Mrowka in the special case of Brieskorn spheres (with at most 4 singular fibers). This…

We use classical Fourier analysis along with tools from the spectral theory of Automorphic forms to derive an asymptotic formula with a strong error term for the number of integer solutions $(a, b, c, d)$ inside the expanding box $[-X,X]^4$…

We give an elementary geometric re-proof of a formula discovered by Michel Brion as well as two variants thereof. A subset of R^n gives rise to a formal Laurent series with monomials corresponding to lattice points in the set. Under…

Lattice polytope representation of natural numbers is introduced based on the fundamental theorem of arithmetic. The combinatorial and geometric properties of the polytopes are studied using Polymake and Qhull software. The volume of the…

We study the problem of enumerating Tarski fixed points on finite lattices. We derive query complexity lower bounds for finding three or more Tarski fixed points of isotone maps and the subclasses of increasing and decreasing isotone maps.…

This paper concerns the number of lattice points in a circle.

We give explicit, polynomial-time computable formulas for the number of integer points in any two-dimensional rational polygon. A rational polygon is one whose vertices have rational coordinates. We find that the basic building blocks of…

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…

The visibility of lattice points from the origin along a polynomial family of curves constitutes a significant generalization of visibility along straight lines. Following the classical notion, where the density equals 1/2, and its…

In this paper, we obtain sharp estimates for the number of lattice points under and near the dilation of a general parabola, the former generalizing an old result of Popov. We apply Vaaler's lemma and the Erd\H{o}s-Turan inequality to…

We present an intriguing question about lattice points in triangles where Pick's formula is "almost correct". The question has its origin in knot theory, but its statement is purely combinatorial. After more than 30 years the topological…

We study the error of the number of unimodular lattice points that fall into a dilated and centred ellipse around $0$. We first show that the study of the error, when the error is normalized by $\sqrt{t}$ with $t$ the parameter of…

Counting integer solutions of linear constraints has found interesting applications in various fields. It is equivalent to the problem of counting lattice points inside a polytope. However, state-of-the-art algorithms for this problem…

We show that the number of rational points of a subgroup inside a toric variety over a finite field defined by a homogeneous lattice ideal can be computed via Smith normal form of the matrix whose columns constitute a basis of the lattice.…

The Polynomial Freiman-Ruzsa conjecture is one of the central open problems in additive combinatorics. If true, it would give tight quantitative bounds relating combinatorial and algebraic notions of approximate subgroups. In this note, we…