Related papers: Lattice angles of lattice polygons
A lattice system is derived which amounts to a higher-rank analogue of the Q3 equation, the latter being an integrable partial difference equation which has appeared in the ABS list of multidimensionally consistent quadrilateral lattice…
First, we calculate the Ehrhart polynomial associated to an arbitrary cube with integer coordinates for its vertices. Then, we use this result to derive relationships between the Ehrhart polynomials for regular lattice tetrahedrons and…
Motivated by Elementary Problem B-1172 in the Fibonacci Quarterly (vol. 53, no. 3, pg. 273), formulas for the areas of triangles and other polygons having vertices with coordinates taken from various sequences of integers are obtained. The…
We study a natural extension to complex numbers of the standard continued fractions. The basic algorithm is due to Lagrange and Gauss, though it seems to have gone mostly unnoticed as a way to create continued fractions. The new…
A classical theorem of Ingham extended Parseval's formula of the trigonometrical system to arbitrary families of exponentials satisfying a uniform gap condition. Later his result was extended to several dimensions, but the optimal…
Lattice results in supersymmetry are summarized. Past, present and future perspectives are discussed.
The paper concerns lattice triangulations, that is, triangulations of the integer points in a polygon in $\mathbb{R}^2$ whose vertices are also integer points. Lattice triangulations have been studied extensively both as geometric objects…
We study geometric consistency relations between angles of 3-dimensional (3D) circular quadrilateral lattices -- lattices whose faces are planar quadrilaterals inscribable into a circle. We show that these relations generate canonical…
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…
This paper introduces a new method for the efficient computation of oscillatory multidimensional lattice sums in geometries with boundaries. Such sums are ubiquitous in both pure and applied mathematics, and have immediate applications in…
Let $f(m,n)$ be the number of primitive lattice triangulations of $m\times n$ rectangle. We compute the limits $\lim_n f(m,n)^{1/n}$ for $m=2$ and $3$. For $m=2$ we obtain the exact value of the limit which is equal to $(611+\sqrt{73})/36$.…
A simple method to obtain a canonical partition function for one dimensional lattice gas model is presented. The simplification is based upon rewriting a sum over all possible configurations to a sum over numbers of clusters in the system.
We present further results on a class of sums which involve complex powers of the distance to points in a two-dimensional square lattice and trigonometric functions of their angle, supplementing those in a previous paper (McPhedran et al,…
In one of the three 2010/2011 issues of the journal 'MathematicalSpectrum', this author gave a three-parameter description of the entire set of integral triangles(i.e. triangles with integer side lengths)and with a 120 degree angle.This…
The dispersion of a point set in the unit square is defined to be the area of the largest empty axis-parallel box. In this paper we are interested in the dispersion of lattices in the plane, that is, the supremum of the area of the empty…
We describe algorithms which address two classical problems in lattice geometry: the lattice covering and the simultaneous lattice packing-covering problem. Theoretically our algorithms solve the two problems in any fixed dimension d in the…
This work is devoted to the proof of the statement about the existence of palindromic continued fractions in an arbitrary dimension. In addition, it is proved the criterion that an algebraic continued fraction has proper cyclic palindromic…
A theorem of Scott gives an upper bound for the normalized volume of lattice polygons with exactly $i>0$ interior lattice points. We will show that the same bound is true for the normalized volume of lattice polytopes of degree 2 even in…
We consider the set of all linear combinations with integer coefficients of the vectors of a unit tight equiangular $(k,n)$ frame and are interested in the question whether this set is a lattice, that is, a discrete additive subgroup of the…
The intrinsic connection between lattice theory and topology is fairly well established, For instance, the collection of open subsets of a topological subspace always forms a distributive lattice. Persistent homology has been one of the…