Related papers: Lattice angles of lattice polygons

Generalizations of QCD in which the number of colors N is taken to infinity are characterized by profound mathematical properties, with far-reaching implications for fundamental problems and for phenomenological issues alike. In this…

We explore the mathematical consequences of the assumption of a discrete space-time. The fundamental laws of physics have to be translated into the language of discrete mathematics. We find integral transformations that leave the lattice of…

We study lattice points in d-dimensional spheres, and count their number in thin spherical segments. We found an upper bound depending only on the radius of the sphere and opening angle of the segment. To obtain this bound we slice the…

We answer a question of Vorobets by showing that the lattice property for flat surfaces is equivalent to the existence of a positive lower bound for the areas of affine triangles. We show that the set of affine equivalence classes of…

We give continued fraction algorithms for a particular class of Fuchsian triangle groups. In particular, we give an explicit form of each such group that is a subgroup of the Hilbert modular group of its trace field and provide an interval…

We consider the lattice point problem corresponding to a family of elliptic paraboloids in $\mathbb{R}^d$ with $d\ge3$ and we prove the expected to be optimal exponent, improving previous results. This is especially noticeable for $d=3$…

We locate gaps in the spectrum of a Hamiltonian on a periodic cuboidal (and generally hyperrectangular) lattice graph with $\delta$ couplings in the vertices. We formulate sufficient conditions under which the number of gaps is finite. As…

The aim of the present paper is to consider the hyperbolic limit of an elliptic hypergeometric sum/integral identity, and associated lattice model of statistical mechanics previously obtained by the second author. The hyperbolic…

We provide a remarkably simple algorithm to compute all (at most four) common tangents of two disjoint simple polygons. Given each polygon as a read-only array of its corners in cyclic order, the algorithm runs in linear time and constant…

We prove that any finite collection of polygons of equal area has a common hinged dissection. That is, for any such collection of polygons there exists a chain of polygons hinged at vertices that can be folded in the plane continuously…

I review recent progress in finite temperature lattice calculations, including calculations of Equation of State, fluctuations of conserved charges and spatial correlation functions. I compare lattice results with the predictions of hadron…

It is known that, adding the number of lattice points lying on the boundary of a reflexive polygon and the number of lattice points lying on the boundary of its polar, always yields 12. Generalising appropriately the notion of reflexivity,…

The ordinary continued fractions expansion of a real number is based on the Euclidean division. Variants of the latter yield variants of the former, all encompassed by a more general Dynamical Systems framework. For all these variants the…

In this paper, we use a simple discrete dynamical model to study integer partitions and their lattice. The set of reachable configurations of the model, with the order induced by the transition rule defined on it, is the lattice of all…

This is the first paper in a series on intrinsic Donaldson-Thomas theory, where we develop a new framework for enumerative geometry that allows the generalization of constructions and results from linear moduli stacks to general non-linear…

The construction of discrete velocity models or numerical methods for the Boltzmann equation, may lead to the necessity of computing the collision operator as a sum over lattice points. The collision operator involves an integral over a…

We introduced a new continued fraction expansions in our previous paper. For these expansions, we show formulae of probability about incomplete quotients. Furthermore, we prove the existence of invariant measures with respect to the…

The Gauss Circle Problem concerns finding asymptotics for the number of lattice point lying inside a circle in terms of the radius of the circle. The heuristic that the number of points is very nearly the area of the circle is surprisingly…

We introduce certain lattice sums associated with hyperplane arrangements, which are (multiple) sums running over integers, and can be regarded as generalizations of certain linear combinations of zeta-functions of root systems. We also…

In this paper, we continue our previous work on the reduction of algebraic lattices over imaginary quadratic fields for the special case when the lattice is spanned over a two dimensional basis. In particular, we show that the…