Searcharxiv⌕ Search

arXiv subjects

Igor E. Shparlinski

Publications and source records attributed to Igor E. Shparlinski.

At least 19 recordsLinked to original sources

On the equidistribution of eigenfunctions of higher dimensional cat maps modulo prime powers

The so-called $\mathit{Cat\ Map}$, which is a linear map generated by symplectic matrices $A \in \operatorname{Sp}(2d,\mathbb Z)$ modulo an integer $N\ge 1$ is a classical discrete model of quantum ergodicity. For $d=1$ it has been investigated by P. Kurlberg and Z. Rudnick (2001), J. Bourgain (2007) and A. Ostafe, I. E. Shparlinski and J. F. Voloch (2023). The significantly more difficult case of $d>1$ has been studied by P. Kurlberg, A. Ostafe, Z. Rudnick and I. E. Shparlinski (2025). All these works apply only to almost all $N$ and are unable to provide an explicit sequence of such ``good'' values of $N$. The authors (2026) have given such a construction with a polynomial decay on the corresponding matrix coefficients. Here we use some new ideas and improve this bound.

math.NT↗

Short sums of the Möbius function over function fields

We develop a new method which allows us to estimate, with a power saving, sums of the M{ö}bius function over function fields ${\mathbb F}_p(X)$. The sums run over monic polynomials with all other coefficients in short intervals, of length below the Pólya--Vinogradov threshold $p^{1/2}$. A classical result of L. Stickelberger (1898) reduces this question to bounding character sums with polynomial discriminants which are inhomogeneous multivariate polynomials. Variants of Burgess's method with non-linear shifts {\it {à} la carte} are introduced to go beyond the Pólya--Vinogradov range, combined with a stratification result of J. Xu (2020) for complete character sums.

math.NT↗

On the Erdős--Odlyzko--Sárközy conjecture for prime-power moduli

Erdős, Odlyzko and Sárközy conjectured that every reduced residue class modulo $q$ contains a product of two primes not exceeding $q$. O. Klurman, A. P. Mangerel and J. Teräväinen (2023) have shown that three primes suffice when $q$ is sufficiently smooth. We study the moduli $q=p^γ$ that are powers of a fixed prime $p$ and we show that the third prime can be taken subpolynomially small. For any $q_\bullet\le q$ for which $q_\bullet\ge\exp\bigl(C(\log q)^{2/3}(\log\log q)^{4/3}\bigr)$, we give an asymptotic formula for the weighted number of representations of each reduced class as a product of two primes not exceeding $q$ and a third not exceeding~$q_\bullet$. We also show that the conjecture holds for all but a proportion $\exp\bigl(-c(\log q)^{1/3}(\log\log q)^{-1/3}\bigr)$ of the reduced classes. Here $C$ and $c$ are positive constants that depend only on $p$. Both results are unconditional and they rely on a wide zero-free region with no exceptional zeros for the Dirichlet $L$-functions attached to characters modulo $p^γ$.We also present conditional versions of these results for arbitrary $q$ under a quasi-Riemann hypothesis.

math.NT↗

Counting integer matrices with square-free determinants

We consider the set ${\mathcal M}_n\left({\mathbb Z}; H\right)$ of $n\times n$-matrices with integer elements of size at most $H$ and obtain an asymptotic formula for the number of matrices from ${\mathcal M}_n\left({\mathbb Z}; H\right)$ with square-free determinants. We also use our approach with some further enhancements to obtain an asymptotic formula for the sums of the Euler function with determinants of matrices from ${\mathcal M}_n\left({\mathbb Z}; H\right)$.

math.NT↗

Energy bounds for modular roots and their applications

We generalise and improve some recent bounds for additive energies of modular roots. Our arguments use a variety of techniques, including those from additive combinatorics, algebraic number theory and the geometry of numbers. We give applications of these results to new bounds on correlations between Salié sums and to a new equidistribution estimate for the set of modular roots of primes.

math.NT↗

Systems of equations with elements of finitely generated groups and with linear recurrence sequences

We obtain new and essentially optimal bounds on the number of solutions of diagonal systems of $k$ polynomial equations in $s$ variables from an arbitrary finite subset of a finitely generated group in a field of characteristic zero. Our bounds generalise and sometimes improve previous results of J. Bourgain, M. Z. Garaev, S. V. Konyagin, and I. E. Shparlinski (2014), for $k=1$, and of A. Manning, A. Ostafe and I. E. Shparlinski (2026), for $k=2$. In turn, this improvement leads to sharpening a result of A. Manning, A. Ostafe and I. E. Shparlinski (2026) concerning arithmetic statistics of certain matrices. We also obtain similar results for $s$-tuples of linear recurrence sequences, in the case of linear equations and quadratic equations.

math.NT↗

Tridimensional character sums with polynomial arguments and applications

Let $p$ be a large prime and $χ$ a non-trivial Dirichlet character modulo $p$. We study the character sum \[ \sum_{a \sim A} \sum_{b \sim B} \sum_{c \sim C} α(a,b) β(c)χ(f(a) + bc), \] where $z \sim Z$ means $Z\le z < 2Z$, $f \in \mathbb{Z}[X]$ is of small degree $k$, and $\boldsymbolα=(α(a,b))_{a\sim A,b\sim B}$ and $\boldsymbolβ=(β(c))_{c\sim C}$ are two complex coefficients. We prove non-trivial upper bounds for this sum in either of the two cases: (1) $\boldsymbolβ\equiv1$, $k=2,3,4,5$ and $A,B,C>p^{\frac{1}{8}+\varepsilon}$, (2) $\boldsymbolβ$ general, $k=2,3$ and $A,B,C>p^{\frac{1}{6}+\varepsilon}$, where $\varepsilon>0$ is fixed. This work was originally motivated by an intermediate result of Ganguly and Rajan (2023) on counting $2\times2$ matrices over $\mathbb{F}_p$ with irreducible characteristic polynomials, where the entries are in short segments. The new bounds here allow us to count such matrices in much shorter segments.

math.NT↗

On the generation of multiplicative groups by small primes

Motivated by a question of Regev arising from his improved quantum factoring algorithm, we study how many small primes are needed to generate the group $({\mathbb Z}/q{\mathbb Z})^\times$ when each prime may be used with exponent only $0$ or $1$. We prove that, for every fixed $\varepsilon>0$ and $A>0$, there is an absolute constant $C_*$ and a set of at most $(\log Q)^{1+\varepsilon}$ primes, all at most $(\log Q)^{C_*(A+1)}$, such that for all but $O(Q(\log Q)^{-A})$ (with the implied constant depending only on $\varepsilon$ and $A$) integers $q\leq Q$, every element of $({\mathbb Z}/q{\mathbb Z})^\times$ is a product of a subset of these primes modulo $q$. The exponent $1+\varepsilon$ in the number of primes is best possible up to the arbitrary $\varepsilon$ in the exponent.

math.NT↗

Arithmetic structure of $L_2$-norms of ${\mathrm{SL}}_2(\mathbb{Z})$ matrices

For a matrix $γ\in\mathrm{SL}_2({\mathbb Z})$, we define \[ {\mathcal R}(γ)=a_1^2+a_2^2+a_3^2+a_4^2, \qquad \text{where} \ γ=\begin{pmatrix}a_1&a_2\\ a_3&a_4\end{pmatrix}, \] and let $S_{\mathrm{sq}}(X)$ count the number of matrices $γ$ with $\|γ\|_\infty = \max\{|a_1|, |a_2|,|a_3|,|a_4|\} \leq X$ and such that ${\mathcal R}(γ)$ is squarefree. We prove that \[ S_{\mathrm{sq}}(X) = {\mathfrak S}_{\mathcal R}^{\mathrm{sq}}N(X) +O(X^{19/10+o(1)}), \quad \text{as}\ X\to \infty, \] where $N(X)=\#\{γ\in{\mathrm{SL}}_2({\mathbb{Z}}):\|γ\|_\infty\leq X\}$ and ${\mathfrak{S}}_{\mathcal{R}}^{\mathrm{sq}}$ is an explicit positive Euler product of local $p^2$-densities. The proof combines the $δ$-method for small moduli with a sum-of-two-squares estimate for large square divisors. This complements a result of J. B. Friedlander and H. Iwaniec (2009) on prime values of ${\mathcal R}(γ)$, which, however, is conditional on a very strong form of the Elliott--Halberstam conjecture. We also show that ${\mathcal R}(γ)$ is squarefree and has at most $9$ prime divisors for at least $cN(X)/\log X$ matrices $γ\in\mathrm{SL}_2({\mathbb Z})$ with $\|γ\|_\infty\le X$, where $c>0$ is an absolute constant.

math.NT↗

Counting Irreducible polynomials with coefficients from thin subgroups

L. Bary-Soroker and R. Shmueli (2026) have given an asymptotic formula for the number of irreducible polynomials over the finite fields $\mathbb F_q$ of $q$ elements, such that their coefficients are perfect squares in $\mathbb F_q$ and also extended this to classes of polynomials with coefficients described by finitely many unions of intersections of polynomial images. Here we use a different approach, which allows us to obtain another generalisation of this result to polynomials with coefficients from small subgroups of $\mathbb F_q^*$. As a demonstration of the power of our approach, we also use it to count such irreducible polynomials with an additional condition, namely, with a prescribed value of their discriminant. This generalisation seems to be unachievable via the approach of L. Bary-Soroker and R. Shmueli (2026).

math.NT↗

On the sparsity of non-diagonalisable integer matrices and matrices with a given discriminant

We consider the set $\mathcal M_n(\mathbb Z; H)$ of $n\times n$-matrices with integer elements of size at most $H$ and obtain upper bounds on the number of matrices from $\mathcal M_n(\mathbb Z; H)$, for which the characteristic polynomial has a fixed discriminant $d$. When $d=0$, this corresponds to counting matrices with a repeated eigenvalue, and thus is related to counting non-diagonalisable matrices. For $d\ne 0$, this problem seems not to have been studied previously, while for $d=0$, both our approach and the final result improve on those of A. J. Hetzel, J. S. Liew and K. Morrison (2007).

math.NT↗

On Artin's conjecture on average and short character sums

Let $N_a(x)$ denote the number of primes up to $x$ for which the integer $a$ is a primitive root. We show that $N_a(x)$ satisfies the asymptotic predicted by Artin's conjecture for almost all $1\le a\le \exp((\log \log x)^2)$. This improves on a result of Stephens (1969). A key ingredient in the proof is a new short character sum estimate over the integers, improving on the range of a result of Garaev (2006).

math.NT↗

Shifted bilinear sums of Salié sums and the distribution of modular square roots of shifted primes

We establish various upper bounds on Type-I and Type-II shifted bilinear sums with Salié sums modulo a large prime $q$. We use these bounds to study, for fixed integers $a,b\not \equiv 0 \bmod q$, the distribution ofsolutions to the congruence $x^2 \equiv ap+b \bmod q$, over primes $p\le P$. This is similar to the recently studied case of $b = 0$, however the case $b\not \equiv 0 \bmod q$ exhibits some new difficulties.

math.NT↗

Multiplicative dependence in the denominators of points of elliptic curves

Let $E_1, \ldots, E_s $ be $s$, not necessary distinct, elliptic curves over $\mathbb{Q}$. We give upper bounds on the frequency of $s$-tuples of points in $E_1(\mathbb{Q})\times \ldots \times E_s(\mathbb{Q})$ whose denominators or $x$-coordinates are multiplicatively dependent. More precisely, we give such bounds in two scenarios: one in which we fix $s$ non-torsion $\mathbb{Q}$-rational points $P_i \in E_i(\mathbb{Q})$ and arbitrary $\mathbb{Q}$-rational points $Q_i \in E_i(\mathbb{Q})$, $i =1, \ldots, s$, and we count $s$-tuples \[ (n_1P_1+Q_1,\ldots, n_sP_s+Q_s) \in E_1(\mathbb{Q}) \times \ldots \times E_s(\mathbb{Q}) \] with $n_1, \ldots, n_s$ in an arbitrary interval of length $N$, and the second in which we count points $(P_1,\ldots,P_s) \in E_1(\mathbb{Q}) \times \ldots \times E_s(\mathbb{Q})$ of bounded canonical height.

math.NT↗

On quantum ergodicity for higher dimensional cat maps modulo prime powers

A discrete model of quantum ergodicity of linear maps generated by symplectic matrices $A \in \mathrm{Sp}(2d,\mathbb{Z})$ modulo an integer $N\ge 1$, has been studied for $d=1$ and almost all $N$ by P. Kurlberg and Z. Rudnick (2001). Their result has been strengthened by J. Bourgain (2005) and subsequently by A. Ostafe, I. E. Shparlinski, and J. F. Voloch (2023). For arbitrary $d$ this has been studied by P. Kurlberg, A. Ostafe, Z. Rudnick and I. E. Shparlinski (2024). The corresponding equidistribution results, for certain eigenfunctions, share the same feature: they apply to almost all moduli $N$ and are unable to provide an explicit construction of such ``good'' values of $N$. Here, using a bound of I. E. Shparlinski (1978) on exponential sums with linear recurrence sequences modulo a power of a fixed prime, we construct such an explicit sequence of $N$, with a power saving on the discrepancy.

math.NT↗

Triple sums of Kloosterman sums and the discrepancy of modular inverses

We investigate the distribution of modular inverses modulo positive integers $c$ in a large interval. We provide upper and lower bounds for their box, ball and isotropic discrepancy, thereby exhibiting some deviations from random point sets. The analysis is based, among other things, on a new bound for a triple sum of Kloosterman sums.

math.NT↗

On the Dynamical System Generated by the Möbius Transformation at Smooth Times

We study the distribution of the sequence of the first $N$ elements of the discrete dynamical system generated by the Möbius transformation $x \mapsto (αx + β)/(γx + δ)$ over a finite field of $p$ elements at the moments of time that correspond to $Q$-smooth numbers, that is, to numbers composed out of primes up to $Q$. In particular, we obtain nontrivial estimates of exponential sums with such sequences.

math.NT↗