Related papers: On the equality of Dedekind sums
A sum where each of the $N$ summands can be independently chosen from two choices yields $2^N$ possible summation outcomes. There is an $\mathcal{O}(K^2)$-algorithm that finds the $K$ smallest/largest of these sums by evading the…
A generalized word in two positive definite matrices A and B is a finite product of nonzero real powers of A and B. Symmetric words in positive definite A and B are positive definite, and so for fxed B, we can view a symmetric word, S(A,B),…
We present some congruences modulo $p^{6-d}$ for sums of the type $\sum_{k=0}^{(p-3)/2}x^k{2k\choose k}/(2k+1)^d$, for $d=1,2,3$ where $p>5$ is a prime.
In this paper we study the cones corresponding to sums of squares of $n$-ary $d$-ic forms with at most $k$ terms. We show that these are strictly nested as $k$ increases, leading to the usual sum of squares cone. We also discuss the duals…
A pair of elements $a,b$ in an integral domain $R$ is an idempotent pair if either $a(1-a) \in bR$, or $b(1-b) \in aR$. $R$ is said to be a PRINC domain if all the ideals generated by an idempotent pair are principal. We show that in an…
We employ a generalised version of Heath-Brown's square sieve in order to establish an asymptotic estimate of the number of solutions $a, b \in \mathbb N$ to the equations $a+b=n$ and $a-b=n$, where $a$ is $k$-free and $b$ is $l$-free. This…
We introduce and study the \emph{Rademacher-Carlitz polynomial} \[ \RC(u, v, s, t, a, b) := \sum_{k = \lceil s \rceil}^{\lceil s \rceil + b - 1} u^{\fl{\frac{ka + t}{b}}} v^k \] where $a, b \in \Z_{>0}$, $s, t \in \R$, and $u$ and $v$ are…
Several methods are used to evaluate finite trigonometric sums. In each case, either the sum had not previously been evaluated, or it had been evaluated, but only by analytic means, e.g., by complex analysis or modular transformation…
Recent results about sums of cubes of Fibonacci numbers [Frontczak, 2018] are extended to arbitrary powers.
We prove that the number of cyclically symmetric, self-complementary plane partitions contained in a cube of side $2n$ equals the square of the number of totally symmetric, self-complementary plane partitions contained in the same cube,…
It is a classic result that two number fields have equal Dedekind zeta functions if and only if the arithmetic type of a prime $p$ is the same in both fields for almost all prime $p$. Here, almost all means with the possible exception of a…
In this paper, we investigate sums of four squares of integers whose prime factorizations are restricted, making progress towards a conjecture of Sun that states that two of the integers may be restricted to the forms $2^a3^b$ and $2^c5^d$.…
This is the first in a series of three papers dealing with sums of squares and hypoellipticity in the infinite regime. We give a sharp sufficient condition on a smooth nonnegative function f on n-dimensional Euclidean space so that it can…
We connect Dedekind sums and Alexander polynomials of torus knots.
In this paper, we evaluate a smoothed sum of the form $\displaystyle \sideset{}{^*}\sum_{d \leq X}\left(\sum_{n \leq Y} \left(\frac{8d}{n} \right ) \right)^2$, where $\left ( \frac{8d}{\cdot} \right )$ is the Kronecker symbol and…
Every natural number greater than two may be written as the sum of a prime and a square-free number. We establish several generalisations of this, by placing divisibility conditions on the square-free number.
For an even integer $k$, let $r_{2k}(n)$ be the number of representations of $n$ as a sum of $2k$ squares. The quantity $r_{2k}(n)$ is appoximated by the classical singular series $\rho_{2k}(n) \asymp n^{k-1}$. Deligne's bound on the…
We determine all perfect powers that can be written as the sum of at most 10 consecutive squares.
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…
A decomposition of a natural number n is a sequence of consecutive natural numbers that sums to n. We construct a one-to-one correspondence between the odd factors of a natural number and its decompositions. We study the decompositions by…