Given an absolutely irreducible ternary form $F$, the purpose of this paper is to produce better upper bounds for the number of integer solutions to the equation F=0, that are restricted to lie in very lopsided boxes. As an application of the main result, a new paucity estimate is obtained for equal sums of two like powers.
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 bounds depend solely on the volume of the boxes, and not on their diameter. This generalisation relies a novel lattice-point counting technique involving estimates for the higher successive minima of certain naturally arising lattices.
We study the Kronecker sequence $\{nα\}_{n\leq N}$ on the torus ${\mathbb T}^d$ when $α$ is uniformly distributed on ${\mathbb T}^d.$ We show that the discrepancy of the number of visits of this sequence to a random box, normalized by $\ln^d N$, converges as $N\to\infty$ to a Cauchy distribution. The key ingredient of the proof is a Poisson limit theorem for the Cartan action on the space of $d+1$ dimensional lattices.
We show that deciding the equality of two Dedekind sums $S(c,b)$, $S(d,b)$ is equivalent to deciding whether a Dedekind sum defined by $b, c, d$ takes a certain value. By means of this result we construct infinite sequences of pairwise equal Dedekind sums. Moreover, we prove a result that says how many Dedekind sums $S(d,b)$, $1\le d\le b-1$, may be equal to a given $S(c,b)$ if $b$ is a square-free number.
In this work we establish a Burgess bound for short multiplicative character sums in arbitrary dimensions, in which the character is evaluated at a homogeneous form that belongs to a very general class of "admissible" forms. This $n$-dimensional Burgess bound is nontrivial for sums over boxes of sidelength at least $q^β$, with $β> 1/2 - 1/(2(n+1))$. This is the first Burgess bound that applies in all dimensions to generic forms of arbitrary degree. Our approach capitalizes on a recent stratification result for complete multiplicative character sums evaluated at rational functions, due to the s…
Let $f$ be a polynomial of degree $d>6$, with integer coefficients. Then the paucity of non-trivial positive integer solutions to the equation $f(a)+f(b)=f(c)+f(d)$ is established. The corresponding situation for equal sums of three like polynomials is also investigated.
Dedekind sums $s(m,n)$ occur in many fields of mathematics. Since $s(m_1,n)=s(m_2,n)$ if $m_1\equiv m_2$ mod $n$, it is natural to ask which of the Dedekind sums $s(m,n)$, $0\le m<n$, take equal values. So far no simple criterion is known by which the equality of $s(m_1,n)$ and $s(m_2,n)$ could be decided. In this note we show how to obtain non-obvious examples of equal Dedekind sums. We consider two cases which mark the extreme possibilities for the argument $n$, namely, $n$ a prime power and $n$ square-free. Whereas we can give a partial overview of equal Dedekind sums in the prime power cas…
In [Girstmair, A criterion for the equality of Dedekind sums mod $\mathbb{Z}$, Internat. J. Number Theory 10: (2014) 565--568], it was shown that the necessary condition $b \mid (a_1 a_2-1)(a_1-a_2)$ for equality of two dedekind sums $s(a_1,b)$ and $s(a_2,b)$ given in [Jabuka, Robins and Wang, When are two Dedekind sums equal? Internat. J. Number Theory 7: (2011) 2197--2202] is equivalent to $12s(a_1,b)-12s(a_2,b) \in \mathbb{Z}$. In this note, we give a new proof of this result and then find two additional necessary and sufficient conditions for $12s(a_1,b)-12s(a_2,b) \in 2\mathbb{Z}, 4\mathb…
A new polynomial sieve is presented and used to show that almost all integers have at most one representation as a sum of two values of a given polynomial of degree at least 3.
In a previous it was shown that the Dedkind sums $12s(m,n)$ and $12s(x,n)$, $1\le m,x\le n$, $(m,n)=(x,n)=1$, are equal mod $\Z$ if, and only if, $(x-m)(xm-1)\equiv 0$ mod $n$. Here we determine the cardinality of numbers $x$ in the above range that satisfy this congruence for a given number $m$.
Using a generalization due to Lerch [M. Lerch, Sur un théorème de Zolotarev. Bull. Intern. de l'Acad. François Joseph 3 (1896), 34-37] of a classical lemma of Zolotarev, employed in Zolotarev's proof of the law of quadratic reciprocity, we determine necessary and sufficient conditions for the difference of two Dedekind sums to be in $8\mathbb{Z}$. These yield new necessary conditions for equality of two Dedekind sums. In addition, we resolve a conjecture of Girstmair [Girstmair, Congruences mod 4 for the alternating sum of the partial quotients, arXiv: 1501.00655].
In [3] it was shown that the Dedekond sums $s(m_1,n)$ and $s(m_2,n)$ are equal only if $(m_1m_2-1)(m_1-m_2)\equiv 0$ mod $n$. Here we show that the latter condition is equivalent to $12s(m_1,n)-12s(m_2,n)\in \Z$. In addition, we determine, for a given number $m_1$, the number of integers $m_2$ in the range $0\le m_2<n$, $(m_1,m_2)=1$, such that $12s(m_1,n)-12s(m_2,n)\in \Z$, provided that $n$ is square-free.
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 our knowledge such statements have not appeared in the literature. A similar theorem is proved for the more general Dedekind-Rademacher sums as well, namely that for any fixed non-negative integer $n$, a positive integer modulus $b$, and two integers $a_1$ and $a_2$ that are relatively prime to $b$, the hypothesis $r_n (a_1,b)= r_n (a_2,b)$ implies that $b \…
In this paper we consider the Diophantine equation \begin{align*}b^k +\left(a+b\right)^k &+ \cdots + \left(a\left(x-1\right) + b\right)^k=\\ &=d^l + \left(c+d\right)^l + \cdots + \left(c\left(y-1\right) + d\right)^l, \end{align*} where $a,b,c,d,k,l$ are given integers. We prove that, under some reasonable assumptions, this equation has only finitely many integer solutions.
Let $k \ge 2$ and $s$ be positive integers, and let $n$ be a large positive integer subject to certain local conditions. We prove that if $s \ge k^2+k+1$ and $θ> 31/40$, then $n$ can be expressed as a sum $p_1^k + \dots + p_s^k$, where $p_1, \dots, p_s$ are primes with $|p_j - (n/s)^{1/k}| \le n^{θ/k}$. This improves on earlier work by Wei and Wooley and by Huang who proved similar theorems when $θ> 19/24$.
In this paper we study the Diophantine equation \begin{align*} b^k + \left(a+b\right)^k + &\left(2a+b\right)^k + \ldots + \left(a\left(x-1\right) + b\right)^k = \\ &y\left(y+c\right) \left(y+2c\right) \ldots \left(y+ \left(\ell-1\right)c\right), \end{align*} where $a,b,c,k,\ell$ are given integers under natural conditions. We prove some effective results for special values for $c,k$ and $\ell$ and obtain a general ineffective result based on Bilu-Tichy method.
Considering the problem of finding all the integer solutions of the sum of $M$ consecutive integer squares starting at $a^{2}$ being equal to a squared integer $s^{2}$, it is shown that this problem has no solutions if $M\equiv3,5,6,7,8$ or $10 (mod\,12)$ and has integer solutions if $M\equiv0,9,24$ or $33 (mod\,72)$; or $M\equiv1,2$ or $16 (mod\,24)$; or $M\equiv11 (mod\,12)$. All the allowed values of $M$ are characterized using necessary conditions. If $M$ is a square itself, then $M\equiv1 (mod\,24)$ and $(M-1)/24$ are all pentagonal numbers, except the first two.
Given a positive integer $n$ the $k$-fold divisor function $d_k(n)$ equals the number of ordered $k$-tuples of positive integers whose product equals $n$. In this article we study the variance of sums of $d_k(n)$ in short intervals and establish asymptotic formulas for the variance of sums of $d_k(n)$ in short intervals of certain lengths for $k=3$ and for $k \ge 4$ under the assumption of the Lindelöf hypothesis.
All integer solutions $\left(M,a,c\right)$ to the problem of the sums of $M$ consecutive cubed integers $\left(a+i\right)^{3}$ ($a>1$, $0\leq i\leq M-1$) equaling squared integers $c^{2}$ are found by decomposing the product of the difference and sum of the triangular numbers of $\left(a+M-1\right)$ and $\left(a-1\right)$ in the product of their greatest common divisor $g$ and remaining square factors $δ^{2}$ and $σ^{2}$, yielding $c=gδσ$. Further, the condition that $g$ must be integer for several particular and general cases yield generalized Pell equations whose solutions allow to find all …
We study the representations of large integers $n$ as sums $p_1^2 + ... + p_s^2$, where $p_1,..., p_s$ are primes with $| p_i - (n/s)^{1/2} | \le n^{θ/2}$, for some fixed $θ< 1$. When $s = 5$ we use a sieve method to show that all sufficiently large integers $n \equiv 5 \pmod {24}$ can be represented in the above form for $θ> 8/9$. This improves on earlier work by Liu, Lü and Zhan, who established a similar result for $θ> 9/10$. We also obtain estimates for the number of integers $n$ satisfying the necessary local conditions but lacking representations of the above form with $s = 3, 4$. When $…
This paper is concerned with the diophantine system, $\sum_{i=1}^{s_1} x_i^r=\sum_{i=1}^{s_2} y_i^r,\, r=1,\,2,\,\ldots,\,k, $ where $s_1$ and $s_2$ are integers such that the total number of terms on both sides, that is, $s_1+s_2,$ is as small as possible. We define $β(k)$ to be the minimum value of $s_1+s_2$ for which there exists a nontrivial solution of this diophantine system. We find nontrivial integer solutions of this diophantine system when $k < 6$, and thereby show that $β(2) =4,\;\, β(3) = 6,\;\, 7 \leq β(4) \leq 8$ and $8 \leq β(5) \leq 10$.
Sums of $M$ consecutive squared integers $\left(a+i\right)^{2}$ equaling squared integers (for $a\geq1$, $0\leq i\leq M-1$) yield certain linear groupings of pairs $\left(a_{1},a_{2}\right)$ of $a$ values for successive same values of $M$ when these are linked by $a_{1}+a_{2}=μM+1$ with $μ=\left(η/δ\right)\in\mathbb{\mathbb{Q}}^{+}$. In this paper, congruent conditions on $M,η,δ$, and on the difference $\left(a_{2}-a_{1}\right)$ are demonstrated for these linear groupings to hold. It is found that $η\equiv1\left(mod\,2\right)$ and $δ\equiv0,1$ or $5\left(mod\,6\right)$, and if $δ\equiv0\left(m…
Using a recent result of Salberger, we establish the paucity of non-trivial positive integer solutions to a certain system of diagonal Diophantine equations.
For "almost all" sufficiently large $N,$ satisfying necessary congruence conditions and $k\geq 2$, we show that there is an {\bf asymptotic formula} for the number of solutions of the equation \begin{align*} \begin{split} &N=p_{1}^{k}+p_{2}^{k}+\cdots+p_{s}^{k}, \\ &\left|p_{i}-( N/s)^{1/k}\right|\leq (N/s)^{θ/k},\ (1\leq i\leq s) \end{split} \end{align*} with \begin{align*} s\geq \frac{k(k+1)}{2}+1\ \ \textup{and}\ \ θ\geq {\bf 2/3}+\varepsilon. \end{align*} This enlarges the effective range of $s$ for which can be obtained by the method of Mätomaki and Xuancheng Shao \cite{MS}. [Discorrelati…
The problem of finding all the integer solutions in $a$, $M$ and $s$ of sums of $M$ consecutive integer squares starting at $a^{2}\geq1$ equal to squared integers $s^{2}$, has no solutions if $M\equiv3,5,6,7,8$ or $10\left(mod\,12\right)$ and has integer solutions if $M\equiv0,9,24% or %33\left(mod\,72\right)$; or $M\equiv1,2$ or $16\left(mod\,24\right)$; or $M\equiv11\left(mod\,12\right)$. In this paper, additional congruence conditions are demonstrated on the allowed values of $M$ that yield solutions to the problem by using Beeckmans' eight necessary conditions, refining further the possibl…
We give a complete description of all solutions to the equation $f_1^3 + f_2^3 = f_3^3 + f_4^3$ for quadratic forms $f_j \in \mathbb C[x,y]$ and show how Ramanujan's example can be extended to three equal sums of pairs of cubes. We also give a complete census in counting the number of ways a sextic $p \in \mathbb C[x,y]$ can be written as a sum of two cubes. The extreme example is $p(x,y) = xy(x^4-y^4)$, which has six such representations.
In this paper we present a new family of identities for Euler sums and integrals of polylogarithms by using the methods of generating function and integral representations of series. Then we apply it to obtain the closed forms of all quadratic Euler sums of weight equal to ten. Furthermore, we also establish some relations between multiple zeta (star) values and nonlinear Euler sums. As applications of these relations, we give new closed form representations of several cubic Euler sums through single zeta values and linear sums. Finally, with the help of numerical computations of Mathematica o…
We show that Euler's relation and the Taxi-Cab relation are both solutions of the same equation. General solutions of sums of two consecutive cubes equaling the sum of two other cubes are calculated. There is an infinite number of relations to be found among the sums of two consecutive cubes and the sum of two other cubes, in the form of two families. Their recursive and parametric equations are calculated.
Let $k$ be an integer greater than or equal $4$. We show that if a multiplicative function $f$ satisfies \[ f(x_1^2 + x_2^2 + \dots + x_k^2) = f(x_1)^2 + f(x_2)^2 + \dots + f(x_k)^2 \] for all positive integers $x_i$'s, then $f$ is the identity function.
If an integer $n$ is written as a sum of two biquadrates in two different ways, then the elliptic curve $y^2=x^3-nx$ has rank $\geq 3$. If moreover $n$ is odd and the parity conjecture is true, then it has even rank $\geq 4$. Finally, some examples of ranks equal to 4, 5, 6, 7, 8 and 10, are also obtained.
We produce congruences modulo a prime $p>3$ for sums $\sum_k\binom{3k}{k}x^k$ over ranges $0\le k<q$ and $0\le k<q/3$, where $q$ is a power of $p$. Here $x$ equals either $c^2/(1-c)^3$, or $4s^2/\bigl(27(s^2-1)\bigr)$, where $c$ and $s$ are indeterminates. In the former case we deal more generally with shifted binomial coefficients $\binom{3k+e}{k}$. Our method derives such congruences directly from closed forms for the corresponding series.
We examine the sums $S(k,\,n)$ of the $k-$th powers of the $ϕ(n)$ integers $α_1<α_2<\cdots<α_{ϕ(n)}$ less than and prime to $n$ (Euler set) and prove a formula (new) for $S(3,\,n)$. If $n$ equals a prime $p$, we prove a theorem showing a connection of $S(3,\,p)$ with Artin's conjectural constant for primitive roots and with other functions involving primes.
Counting functions are constructed for sums of integers raised to a fixed positive rational power. That is, given values formed by $u_1^{j/k} + u_2^{j/k} + ... + u_l^{j/k}$, $u_i \in \mathbb{Z}^+$, the number of values less than or equal to a given $w>0$ is determined. The counting functions developed are framed in terms of convolution exponentials, and are closely related to the Riemann zeta function. At the conclusion, several estimates are derived, with special emphasis on the case of sums of square roots, i.e. $j=1$, $k=2$.
On pairs of triangular numbers whose product is a perfect square and pairs of intervals of successive integers with equal sums of squares
National Research University Higher School of Economics (HSE)(国立研究大学高等经济大学);RUTCOR, Rutgers,the State University of NJ(罗格斯州立大学新泽西分校 RUTCOR);Rutgers Business School, Rutgers University(罗格斯大学罗格斯商学院)