Related papers: Two Geometric Interpretations of Hardy Sums
Covering is a common type of data structure and covering-based rough set theory is an efficient tool to process this data. Lattice is an important algebraic structure and used extensively in investigating some types of generalized rough…
We consider the problem of finding lower bounds on the number of unlabeled $n$-element lattices in some lattice family. We show that if the family is closed under vertical sum, exponential lower bounds can be obtained from vertical sums of…
This paper is inspired by Richards' work on large gaps between sums of two squares [10]. It is shown in [10] that there exist arbitrarily large values of $\lambda$ and $\mu$, where $\mu \geq C \log \lambda$, such that intervals $[\lambda,…
We compute the sum and the alternating sum of the reciprocals of triangular numbers using two standard methods from calculus: a telescoping series approach and a power series approach. We then extend these results to generalized…
Using the possibility of computationally determining points on a finite cover of a unirational variety over a finite field, we determine all possibilities for direct Gorenstein linkages between general sets of points in P^3 over an…
Let $\Gamma$ be an irreducible lattice in a product of n infinite irreducible complete Kac-Moody groups of simply laced type over finite fields. We show that if n is at least 3, then each Kac-Moody groups is in fact a simple algebraic group…
Recent work in percolation has led to exact solutions for the site and bond critical thresholds of many new lattices. Here we show how these results can be extended to other classes of graphs, significantly increasing the number and variety…
This paper is a continuation of an earlier one, and completes a classification of the configurations of points in a plane lattice that determine angles that are rational multiples of ${\pi}$. We give a complete and explicit description of…
We study lattice sums $\sum \frac{1}{(\|x\|\|y\|\|x+y\|)^s}$ taken over $SL_+(2,\mathbb Z)$, i.e.\ the set of pairs $(x,y)$ of primitive lattice vectors in $\mathbb Z_{\geq 0}^2$ with $\det(x, y) = 1$. We prove convergence of these and…
We derive a formula for the number of lattice points in type B generalized permutohedra, providing a concise alternative to the formula obtained recently by Eur, Fink, Larson, and Spink as a result from a study of delta-matroids. Our…
We study lattice points on hyperbolic circles centred at Heegner points of class number one. Our main result is that, on a density one subset of radii tending to infinity, the angles of such points equidistribute on the unit circle. To…
Coincidence Site Lattices (CSLs) are a well established tool in the theory of grain boundaries. For several lattices up to dimension $d=4$, the CSLs are known explicitly as well as their indices and multiplicity functions. Many of them…
Let $\omega$ be a point in the upper half plane, and let $\Gamma$ be a discrete, finite covolume subgroup of $\mathrm{PSL}_2(\mathbb{R})$. We conjecture an explicit formula for the pair correlation of the angles between geodesic rays of the…
We provide an elementary proof of a formula for the number of northeast lattice paths that lie in a certain region of the plane. Equivalently, this formula counts the lattice points inside the Pitman--Stanley polytope of an n-tuple.
This paper is concerned with configurations of points in a plane lattice which determine angles that are rational multiples of $\pi$. We shall study how many such angles may appear in a given lattice and in which positions, allowing the…
We give a simple example showing that a knot or link diagram that lies in the ${\mathbb{Z}}^2$ lattice is not necessarily the projection of a lattice stick knot or link in the ${\mathbb{Z}}^3$ lattice, and we give a necessary and sufficient…
Consider lattice paths in Z^2 taking unit steps north (N) and east (E). Fix positive integers r,s and put an equivalence relation on points of Z^2 by letting v,w be equivalent if v - w = m (r,s) for some m in Z. Call a lattice path valid if…
Consider a subset [1,2,...,n]x[1,2,...,n] of the plane integer lattice. Take any non self-intersecting n^2-gon built on it (straight angles are allowed). The square of a side length is a positive integer. It is thus natural to ask how large…
In this paper, we prove new upper bounds for sums of reciprocals of fractional parts over general aligned boxes, thus extending a previous result of the author concerning bounds for sums of reciprocals over symmetric boxes. These new upper…
A procedure for the construction and the classification of multilattices in arbitrary dimension is proposed. The algorithm allows to determine explicitly the location of the points of a multilattice given its space group, and to determine…