Related papers: Explicit and efficient formulas for the lattice po…
We state the formula for the critical number of vertices of a convex lattice polygon that guarantees that the polygon contains at least one point of a given sublattice and give a partial proof of the formula. We show that the proof can be…
We construct an algorithm that reduces the complexity for computing generalized Dedekind sums from exponential to polynomial time. We do so by using an efficient word rewriting process in group theory.
A common theme of enumerative combinatorics is formed by counting functions that are polynomials evaluated at positive integers. In this expository paper, we focus on four families of such counting functions connected to hyperplane…
We revisit Eisenstein's geometric proof of quadratic reciprocity and make explicit the involutive symmetry underlying Eisenstein's lattice-point argument. Building on Gauss's lemma, we interpret the Legendre symbols as counts of lattice…
In this case study in ``fully automated enumeration'', we illustrate how to take full advantage of symbolic computation by developing (what we call) `symbolic-dynamical-programming' algorithms for computing many terms of `hard to compute…
We present a compact formula computing rational trigonometric sums. E. Verlinde's expression for the dimension of conformal blocks in WZW theory is an example of such a sum. As an application, we show that a formula of Bismut and Labourie…
We review and possibly add some new variant to the existing derivations of the formula for the area of Jordan lattice polygons drawn on two-dimensional lattices. The formula is known as Pick's theorem and is related to the number theory…
The idea to use classical hypergeometric series and, in particular, well-poised hypergeometric series in diophantine problems of the values of the polylogarithms has led to several novelties in number theory and neighbouring areas of…
We define Dedekind sums attached to a totally real number field of class number one. We prove that they satisfy some reciprocity law. Then we relate them to special values of Hecke $L$-functions. We conclude that they are ruled by Stark's…
In the first part, we consider generalized quadratic Gauss sums as finite analogues of the Jacobi theta function, and the reciprocity law for Gauss sums as their transformation formula. We attach finite Dirichlet series to Gauss sums using…
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…
We obtain new trigonometric identities, which are some product-to-sum type formulas for the higher derivative of the cotangent and cosecant functions. Further, from specializations of our formulas, we derive not only various known…
This paper is dedicated to a lattice analog to the classical ``sum of interior angles of a polygon theorem''. In 2008, the first formula expressing conditions on the geometric continued fractions for lattice angles of triangles was derived,…
In this article, we present an algorithm to compute the 9th Dedekind Number. The key aspects are the use of matrix multiplication and symmetries in the free distributive lattice, which are detected with techniques from Formal Concept…
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,…
We encode arbitrary finite impartial combinatorial games in terms of lattice points in rational convex polyhedra. Encodings provided by these \emph{lattice games} can be made particularly efficient for octal games, which we generalize to…
We give an optimal bound for the remainder when counting the number of rational points on the $n$-dimensional sphere with bounded denominator for any $n\geq 2$.
The Ehrhart quasipolynomial of a rational polytope $\mathsf{P}$ encodes fundamental arithmetic data of $\mathsf{P}$, namely, the number of integer lattice points in positive integral dilates of $\mathsf{P}$. Ehrhart quasipolynomials were…
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 investigate properties of zeta functions of polynomial rings and their quotients, generalizing and extending some classical results about Dedekind zeta functions of number fields. By an application of Delange's version of the Ikehara…