Related papers: An Algorithmic Approach to Pick's Theorem
We study the probability distribution of the area and the number of vertices of random polygons in a convex set $K\subset\mathbb{R}^2$. The novel aspect of our approach is that it yields uniform estimates for all convex sets…
We show that in the spin-network basis it is possible to compute the matrix elements of any given operator of the Hamiltonian formulation of Lattice Gauge Theory (LGT). We give the explicit calculation for the case of the plaquette…
We describe the computation of polytope volumes by descent in the face lattice, its implementation in Normaliz, and the connection to reverse-lexicographic triangulations. The efficiency of the algorithm is demonstrated by several high…
For the space of functions that can be approximated by linear chirps, we prove a reconstruction theorem by random sampling at arbitrary rates.
In this paper, we give a new proof of an arithmetic analogue of the Riemann-Roch Theorem, due originally to Serge Lang. Lang's result was first proved using the lattice point geometry of Minkowski. By contrast, our proof is completely…
We present an algorithm for computing the set of torsion points satisfying a given system of multivariate polynomial equations. Its complexity is quasilinear in the logarithm of the degree of the input equations and exponential in their…
Given a simple polygon $ \mathcal {P} $ of $ n $ vertices in the Plane. We study the problem of computing the visibility area from a given viewpoint $ q $ inside $ \mathcal {P} $ where only sub-linear variables are allowed for working…
We present here algorithms for efficient computation of linear algebra problems over finite fields.
We have developed an improved algorithm that allows us to enumerate the number of site animals (polyominoes) on the square lattice up to size 46. Analysis of the resulting series yields an improved estimate, $\tau = 4.062570(8)$, for the…
In this paper we show how to use elementary methods to prove that the volume of Sl_k R / Sl_k Z is zeta(2) * zeta(3) * ... * zeta(k) / k. Using a version of reduction theory presented in this paper, we can compute the volumes of certain…
Let $k \geq 2$ be a constant. Given any $k$ convex polygons in the plane with a total of $n$ vertices, we present an $O(n\log^{2k-3}n)$ time algorithm that finds a translation of each of the polygons such that the area of intersection of…
An important problem in analytic and geometric combinatorics is estimating the number of lattice points in a compact convex set in a Euclidean space. Such estimates have numerous applications throughout mathematics. In this note, we exhibit…
We present a short elementary proof of the following Twelve Points Theorem: Let M be a convex polygon with vertices at the lattice points, containing a single lattice point in its interior. Denote by m (resp. m*) the number of lattice…
We present an algorithm for the classification of linear codes over finite fields, based on lattice point enumeration. We validate a correct implementation of our algorithm with known classification results from the literature, which we…
We give upper bounds on the minimal degree of a model in $\mathbb{P}^2$ and the minimal bidegree of a model in $\mathbb{P}^1 \times \mathbb{P}^1$ of the curve defined by a given Laurent polynomial, in terms of the combinatorics of the…
The area method is a decision procedure for geometry developed by Chou et al. in the 1990's. The method aims to reduce the specified hypothesis to an algebraically verifiable form by applying elimination lemmas. The order in which the…
We present a formula for the signed area of a spherical polygon via prequantization. In contrast to the traditional formula based on the Gauss-Bonnet theorem that requires measuring angles, the new formula mimics Green's theorem and is…
In this note we classify all triples (a,b,i) such that there is a convex lattice polygon P with area a, and b respectively i lattice points on the boundary respectively in the interior. The crucial lemma for the classification is the…
In this paper we study the lattice point covering property of some regular polygons in dimension 2.
Consider the Poincare disc model for hyperbolic geometry. In this paper, a convenient computational formula is developed along with an aesthetic geometric interpretation. Two proofs, one geometric and one analytical, of each result are…