For a composite $n$ and an odd $c$ with $c$ not dividing $n$, the number of solutions to the equation $n+a\equiv b\mod c$ with $a,b$ quadratic residues modulus $c$ is calculated. We establish a direct relation with those modular solutions and the distances between points of a modular hyperbola. Furthermore, for certain composite moduli $c$, an asymptotic formula for quotients between the number of solutions and $c$ is provided. Finally, an algorithm for integer factorization using such solutions is presented.
We give a lower bound for the number of ordinary lines spanned by a modular hyperbola when the modulus is a prime power. We also give a partial answer to a question of Shparlinski.
We give a survey of a variety of recent results about the distribution and some geometric properties of points $(x,y)$ on modular hyperbolas $xy \equiv a \pmod m$. We also outline a very diverse range of applications of such results, discuss multivariate generalisations and suggest a number of open problems of different levels of difficulty.
In this paper, we study how small a box contains at least two points from a modular hyperbola $x y \equiv c \pmod p$. There are two such points in a square of side length $p^{1/4 + ε}$. Furthermore, it turns out that either there are two such points in a square of side length $p^{1/6 + ε}$ or the least quadratic nonresidue is less than $p^{1/(6 \sqrt{e}) + ε}$.
In this paper we study incidences for hyperbolas in $\mathbf{F}_p$ and show how linear sum--product methods work for such curves. As an application we give a purely combinatorial proof of a nontrivial upper bound for bilinear forms of Kloosterman sums.
Given integers $a$ and $m\ge 2$, let $\Hm$ be the following set of integral points $$ \Hm= \{(x,y) \ : \ xy \equiv a \pmod m,\ 1\le x,y \le m-1\} $$ We improve several previously known upper bounds on $v_a(m)$, the number of vertices of the convex closure of $\Hm$, and show that uniformly over all $a$ with $\gcd(a,m)=1$ we have $v_a(m) \le m^{1/2 + o(1)}$ and furthermore, we have $v_a(m) \le m^{5/12 + o(1)}$ for $m$ which are almost squarefree.
Many problems in additive number theory, such as Fermat's last theorem and the twin prime conjecture, can be understood by examining sums or differences of a set with itself. A finite set $A \subset \mathbb{Z}$ is considered sum-dominant if $|A+A|>|A-A|$. If we consider all subsets of ${0, 1, ..., n-1}$, as $n\to\infty$ it is natural to expect that almost all subsets should be difference-dominant, as addition is commutative but subtraction is not; however, Martin and O'Bryant in 2007 proved that a positive percentage are sum-dominant as $n\to\infty$. This motivates the study of "coordinate sum…
Let $p$ be a large prime number, $K,L,M,λ$ be integers with $1\le M\le p$ and ${\color{red}\gcd}(λ,p)=1.$ The aim of our paper is to obtain sharp upper bound estimates for the number $I_2(M; K,L)$ of solutions of the congruence $$ xy\equivλ\pmod p, \qquad K+1\le x\le K+M,\quad L+1\le y\le L+M $$ and for the number $I_3(M;L)$ of solutions of the congruence $$xyz\equivλ\pmod p, \quad L+1\le x,y,z\le L+M. $$ We obtain a bound for $I_2(M;K,L),$ which improves several recent results of Chan and Shparlinski. For instance, we prove that if $M<p^{1/4},$ then $I_2(M;K,L)\le M^{o(1)}.$ For $I_3(M;L)$ we…
Let $a,k\in\mathbb{N}$. For the $k-1$-th iterate of the exponential function $x\mapsto a^x$, also known as tetration, we write \[ ^k a:=a^{a^{.^{.^{.^{a}}}}}. \] In this paper, we show how an efficient algorithm for tetration modulo natural numbers $N$ may be used to compute the prime factorization of $N$. In particular, we prove that the problem of computing the squarefree part of integers is deterministically polynomial-time reducible to modular tetration.
In this paper, we use Borcherds lifting and the big CM value formula of Bruinier, Kudla, and Yang to give an explicit factorization formula for the norm of $Ψ(\frac{d_1+\sqrt{d_1}}2) -Ψ(\frac{d_2+\sqrt{d_2}}2)$, where $Ψ$ is the $j$-invariant or the Weber invariant $ω_2$. The $j$-invariant case gives another proof of the well-known Gross-Zagier factorization formula of singular moduli, while the Weber invariant case gives a proof of the Yui-Zagier conjecture for $ω_2$. The method used here could be extended to deal with other modular functions on a genus zero modular curve.
For numerical semigroups with a specified list of (not necessarily minimal) generators, we describe the asymptotic distribution of factorization lengths with respect to an arbitrary modulus. In particular, we prove that the factorization lengths are equidistributed across all congruence classes that are not trivially ruled out by modular considerations.
A theorem of Gekeler compares the number of non-isomorphic automorphic representations associated with the space of cusp forms of weight $k$ on $Γ_0(N)$ to a simpler function of $k$ and $N$, showing that the two are equal whenever $N$ is squarefree. We prove the converse of this theorem (with one small exception), thus providing a characterization of squarefree integers. We also establish a similar characterization of prime numbers in terms of the number of Hecke newforms of weight $k$ on $Γ_0(N)$. It follows that a hypothetical fast algorithm for computing the number of such automorphic repre…
We obtain conditions for a trigonometric polynomial t of one variable to equal or be approximated by |p|^2 where p has frequencies in a Bohr set of integers obtained by projecting lattice points in the open planar region bounded by the lines y = alpha*x +- beta where |beta| leq 1/4 and alpha is either rational or irrational with Liouville-Roth constant larger than 2. We derive and use a generalization of the Fejer-Riesz spectral factorization lemma in one dimension, an approximate spectral factorization in two dimensions, the modular group action on the integer lattice, and Diophantine approxi…
In this paper we study regularized Petersson products between a holomorphic theta series associated to a positive definite binary quadratic form and a weakly holomorphic weight 1 modular form with integral Fourier coefficients. In our recent work \cite{Via CM Green} motivated by the conjecture of B. Gross and D. Zagier on the CM values of higher Green's functions we have discovered that such a Petersson product is equal to the logarithm of a certain algebraic number lying in a ring class field associated to the binary quadratic form. The main result of the present paper is the explicit factori…
We give a factorization of averages of Borcherds forms over CM points associated to a quadratic form of signature (n,2). As a consequence of this result, we are able to state a theorem like that of Gross and Zagier about which primes can occur in this factorization. One remarkable phenomenon we observe is that the regularized theta lift of a weakly holomorphic modular form is always finite.
We show that many of Ramanujan's modular equations of degree 3 can be interpreted in terms of integral ternary quadratic forms. This way we establish that for any n in N |{n= x(x+1)/2 + y^2 +z^2 : x,y,z in Z}| >= |{n= x(x+1)/2 + 3y^2 +3z^2: x,y,zin Z}|, just to mention one among many similar positive results of this type. In particular, we prove the recent conjecture of H. Yesilyurt and the first author stating that for any n in N |{n= x(x+1)/2 + y^2 +z^2 : x,y,z in Z}| >= |{n= x(x+1)/2 + 7y^2 + 7z^2: x,y,z in Z}|. We prove a variety of identities for certain ternary forms with discriminants 1…
The reduction modulo $p$ of a family of lacunary integer polynomials, associated with the dynamical zeta function $ζ_β(z)$ of the $β$-shift, for $β> 1$ close to one, is investigated. We briefly recall how this family is correlated to the problem of Lehmer. A variety of questions is raised about their numbers of zeroes in $\mathbb{F}_p$ and their factorizations, via Kronecker's Average Value Theorem (viewed as an analog of classical Theorems of Uniform Distribution Theory). These questions are partially answered using results of Schinzel, revisited by Sawin, Shusterman and Stoll, and density th…
Kings, Lei, Loeffler and Zerbes constructed a three-variable Euler system $κ({\bf g},{\bf h})$ of Beilinson-Flach elements associated to a pair of Hida families $({\bf g},{\bf h})$ and exploited it to obtain applications to the arithmetic of elliptic curves by specializing the Euler system to points of weights $(2,1,1)$. The aim of this article is showing that this Euler system also encodes arithmetic information at points of weights $(1,1,0)$, concerning the group of units of the associated number fields. The setting becomes specially novel and intriguing when ${\bf g}$ and ${\bf h}$ speciali…
This article discusses the classical problem of how to calculate $r_n(m)$, the number of ways to represent an integer $m$ by a sum of $n$ squares from a computational efficiency viewpoint. Although this problem has been studied in great detail, there are very few formulas given for the purpose of computing $r_n(m)$ quickly. More precisely, for fixed $n$, we want a formula for $r_n(m)$ that computes in log-polynomial time (with respect to $m$) when the prime factorization of $m$ is given. Restricting to even $n$, we can view $θ_n(q)$, the theta function associated to sums of $n$ squares, as a m…
We prove a higher dimensional generalization of Gross and Zagier's theorem on the factorization of differences of singular moduli. Their result is proved by giving a counting formula for the number of isomorphisms between elliptic curves with complex multiplication by two different imaginary quadratic fields $K$ and $K^\prime$, when the curves are reduced modulo a supersingular prime and its powers. Equivalently, the Gross-Zagier formula counts optimal embeddings of the ring of integers of an imaginary quadratic field into particular maximal orders in $B_{p, \infty}$, the definite quaternion a…
