Related papers: Explicit and efficient formulas for the lattice po…
A new lattice based scheme for numerical relativity will be presented. The scheme uses the same data as would be used in the Regge calculus (eg. a set of leg lengths on a simplicial lattice) but it differs significantly in the way that the…
Enumerating polygons on regular lattices is a classic problem in rigorous statistical mechanics. The goal of enumerating polygons on the square lattice via fermionic path integration was achieved using a free-fermion quadratic action in the…
We prove area bounds for planar convex bodies in terms of their number of interior integral points and their lattice width data. As an application, we obtain sharp area bounds for rational polygons with a fixed number of interior integral…
We prove a fairly general inequality that estimates the number of lattice points in a ball of positive radius in general position in a Euclidean space. The bound is uniform over lattices induced by a matrix having a bounded operator norm.
Deng (arXiv:math/9812082) gave an asymptotic formula for the number of rational points on a weighted projective space over a number field with respect to a certain height function. We prove a generalization of Deng's result involving a…
We exhibit a probabilistic algorithm which computes a rational point of an absolutely irreducible variety over a finite field defined by a reduced regular sequence. Its time--space complexity is roughly quadratic in the logarithm of the…
We give a formula for the number of irreducibles (with multiplicity) in the decomposition of the plethysm $s_\lambda[s_m]$ of Schur functions in terms of the number of lattice points in certain rational polytopes. In the case where $\lambda…
We provide explicit descriptions for the rational powers and Rees valuations of several classes of ideals invariant under natural actions of tori and products of general linear groups, in terms of polyhedra and lattice points. This allows…
In this paper, we address the problem of counting integer points in a rational polytope described by $P(y) = \{ x \in \mathbb{R}^m \colon Ax = y, x \geq 0\}$, where $A$ is an $n \times m$ integer matrix and $y$ is an $n$-dimensional integer…
We consider the class of multiple Fourier series associated with functions in the Dirichlet space of the polydisc. We prove that every such series is summable with respect to unrestricted rectangular partial sums, everywhere except for a…
The problem of counting polymer coverings on the rectangular lattices is investigated. In this model, a linear rigid polymer covers $k$ adjacent lattice sites such that no two polymers occupy a common site. Those unoccupied lattice sites…
We prove that every indefinite quadratic form with non-negative integer coefficients is the volume polynomial of a pair of lattice polygons. This solves the discrete version of the Heine-Shephard problem for two bodies in the plane. As an…
We derive a combinatorial multisum expression for the number $D(n,k)$ of partitions of $n$ with Durfee square of order $k$. An immediate corollary is therefore a combinatorial formula for $p(n)$, the number of partitions of $n$. We then…
The evaluation of the interaction between objects arranged on a lattice requires the computation of lattice sums. A scenario frequently encountered are systems governed by the Helmholtz equation in the context of electromagnetic scattering…
Counting integer points in large convex bodies with smooth boundaries containing isolated flat points is oftentimes an intermediate case between balls (or convex bodies with smooth boundaries having everywhere positive curvature) and cubes…
There are numerous ways to represent real numbers. We may use, e.g., Cauchy sequences, Dedekind cuts, numerical base-10 expansions, numerical base-2 expansions and continued fractions. If we work with full Turing computability, all these…
We give a new proof for a theorem of Ehrhart regarding the quasi-polynomiality of the function that counts the number of integer points in the integral dilates of a rational polytope. The proof involves a geometric bijection,…
We give an algorithmic proof of Pick's theorem which calculates the area of a lattice-polygon in terms of the lattice-points.
For $A\in\mathbb{Z}^{m\times n}$ we investigate the behaviour of the number of lattice points in $P_A(b)=\{x\in\mathbb{R}^n:Ax\leq b\}$, depending on the varying vector $b$. It is known that this number, restricted to a cone of constant…
Let $s(a,b)$ denote the classical Dedekind sum and $S(a,b)=12s(a,b)$. Recently, Du and Zhang proved the following reciprocity formula. If $a$ and $b$ are odd natural numbers, $(a,b)=1$, then $$ S(2a^*,b)+S(2b^*,a)=\frac{a^2+b^2+4}{2ab}-3,…