Related papers: Explicit and efficient formulas for the lattice po…
Mohammed Ben Alhocain, in an Arab manuscript of the tenth century, stated that the principal object of the theory of rational right triangles is to find a square which when increased or diminished by a certain number $m$ becomes a square…
Pick's astonishing theorem explains how to obtain the area of any integer polygon by counting lattice points. It is a notoriously difficult challenge to translate the geometric statement and intuitive reasoning into a formal statement and…
We introduce the inversion polynomial for Dedekind sums $f_b(x)=\sum x^{\operatorname{inv}(a,b)}$ to study the number of $s(a,b)$ which have the same value for given $b$. We prove several properties of this polynomial and present some…
We present a short elementary proof of the following Twelve Points Theorem: Let M be a convex polygon with vertices at the lattice points, containing a single lattice point in its interior. Denote by m (resp. m*) the number of lattice…
We estimate the lattice sums arising in the context of the integer point counting in polyhedra.
We develop a tensor network technique that can solve universal reversible classical computational problems, formulated as vertex models on a square lattice [Nat. Commun. 8, 15303 (2017)]. By encoding the truth table of each vertex…
We consider pairs of a set-valued column-strict tableau and a reverse plane partition of the same shape. We introduce algortithms for them, which implies a bijective proof for the finite sum Cauchy identity for Grothendieck polynomials and…
To any two-dimensional rational plane in four-dimensional space one can naturally attach a point in the Grassmannian Gr(2,4) and four lattices of rank two. Here, the first two lattices originate from the plane and its orthogonal complement…
There is a simple formula for the Ehrhart polynomial of a cyclic polytope. The purpose of this paper is to show that the same formula holds for a more general class of polytopes, lattice-face polytopes. We develop a way of decomposing any…
A natural question about Dedekind sums is to find conditions on the integers $a_1, a_2$, and $b$ such that $s(a_1,b) = s(a_2, b)$. We prove that if the former equality holds then $ b \ | \ (a_1a_2-1)(a_1-a_2)$. Surprisingly, to the best of…
Given n polynomials in n variables with a finite number of complex roots, for any of their roots there is a local residue operator assigning a complex number to any polynomial. This is an algebraic, but generally not rational, function of…
We establish the equivalence of three notions of $\mathbb{F}_q$-rational points on weighted projective spaces $\mathbb{P}_{\mathbf{w}}^n$ and derive explicit combinatorial formulas for their enumeration, leveraging Burnside's lemma and gcd…
A sum-of-squares is a polynomial that can be expressed as a sum of squares of other polynomials. Determining if a sum-of-squares decomposition exists for a given polynomial is equivalent to a linear matrix inequality feasibility problem.…
The set of prime numbers has been analyzed, based on their algebraic and arithmetical structure. Here by obtaining a sort of linear formula for the set of prime numbers, they are redefined and identified; under a systematic procedure it has…
We apply lattice point counting methods to compute the multiplicities in the plethysm of $GL(n)$. Our approach gives insight into the asymptotic growth of the plethysm and makes the problem amenable to computer algebra. We prove an old…
In this paper, a formula for the calculation of the number of right cosets contained in a double coset with respect to a unimodular group over a Dedekind domain is developed, and applications of this formula in the theory of congruence…
Let $\mathcal A$ be a star-shaped polygon in the plane, with rational vertices, containing the origin. The number of primitive lattice points in the dilate $t\mathcal A$ is asymptotically $\frac6{\pi^2}$ Area$(t\mathcal A)$ as $t\to…
We evaluate in closed form several classes of finite trigonometric sums. Two general methods are used. The first is new and involves sums of roots of unity. The second uses contour integration and extends a previous method used by two of…
We show that each rational number $r$, $0\le r<1$, occurs as the fractional part of a Dedekind sum $S(m,n)$.
Lehmer's totient problem asks if there exists a composite number $d$ such that its totient divide $d-1$. In this article we generalize the Lehmer's totient problem in algebraic number fields. We introduce the notion of a Lehmer number.…