arXiv subjects
Publications and source records attributed to Igor E. Shparlinski.
A Ducci sequence is a sequence of integer $n$-tuples obtained by iterating the map \[ D : (a_1, a_2, \ldots, a_n) \mapsto \big(|a_1-a_2|,|a_2-a_3|,\ldots,|a_n-a_1|\big). \] Such a sequence is eventually periodic and we denote by $P(n)$ the maximal period of such sequences for given $n$. We prove lower bounds for $P(n)$ by counting certain partitions.
We prove that the set of $(x_1, \ldots, x_d)\in [0,1)^d$, such that $$ \underline{\lim}_{N\to \infty}\left| \sum_{n=1}^N\exp(2 πi (x_1n+\ldots + x_dn^d)) \right| =0, $$ contains a dense $\mathcal{G}_δ$ set in $[0,1)^d$ and has a positive Hausdorff dimension. Similar statements are also established for the generalised Gaussian sums $$ \sum_{n=1}^N\exp(2πi x n^d), \qquad x \in [0,1). $$
The authors have recently obtained a lower bound of the Hausdorff dimension of the sets of vectors $(x_1, \ldots, x_d)\in [0,1)^d$ with large Weyl sums, namely of vectors for which $$ \left| \sum_{n=1}^{N}\exp(2πi (x_1 n+\ldots +x_d n^{d})) \right| \ge N^α $$ for infinitely many integers $N \ge 1$. Here we obtain an upper bound for the Hausdorff dimension of these exceptional sets.
In this paper we study the distribution of very short sequences of inversive congruential pseudorandom numbers modulo $2^t$. We derive a new bound on exponential sums with such sequences and use it to give estimate their discrepancy. The technique we use, based the method of N. M. Korobov (1972) of estimating double Weyl sums and a fully explicit form of the Vinogradov mean value theorem due to K. Ford (2002), has never been used in this area and is very likely to find further applications.
In this paper we give a refinement of the bound of D. A. Burgess for multiplicative character sums modulo a prime number $q$. This continues a series of previous logarithmic improvements, which are mostly due to H. Iwaniec and E. Kowalski. In particular, for any nontrivial multiplicative character $χ$ modulo a prime $q$ and any integer $r\ge 2$, we show that $$ \sum_{M<n\le M+N}χ(n) = O\left( N^{1-1/r}q^{(r+1)/4r^2}(\log q)^{1/4r}\right), $$ which sharpens previous results by a factor $(\log q)^{1/4r}$. Our improvement comes from averaging over numbers with no small prime factors rather than over an interval as in previous approaches.
We bound double sums of Kloosterman sums over a finite field ${\mathbb F}_{q}$, with one or both parameters ranging over an affine space over its prime subfield ${\mathbb F}_p \subseteq {\mathbb F}_{q} $. These are finite fields analogues of a series of recent results by various authors in finite fields and residue rings. Our results are based on recent advances in additive combinatorics in arbitrary finite field.
We obtain new lower bounds on the number of smooth squarefree integers up to $x$ in residue classes modulo a prime $p$, relatively large compared to $x$, which in some ranges of $p$ and $x$ improve that of A. Balog and C. Pomerance (1992). We also estimate the smallest squarefull number in almost all residue classes modulo a prime $p$.
We bound Kloosterman-like sums of the shape \[ \sum_{n=1}^N \exp(2πi (x \lfloor f(n)\rfloor+ y \lfloor f(n)\rfloor^{-1})/p), \] with integers parts of a real-valued, twice-differentiable function $f$ is satisfying a certain limit condition on $f''$, and $\lfloor f(n)\rfloor^{-1}$ is meaning inversion modulo~$p$. As an immediate application, we obtain results concerning the distribution of modular inverses inverses $\lfloor f(n)\rfloor^{-1} \pmod{p}$. The results apply, in particular, to Piatetski-Shapiro sequences $ \lfloor t^c\rfloor$ with $c\in(1,\frac{4}{3})$. The proof is an adaptation of an argument used by Banks and the first named author in a series of papers from 2006 to 2009.
Given a subgroup $Γ$ of rational points on an elliptic curve $E$ defined over ${\mathbf Q}$ of rank $r \ge 1$ and any sufficiently large $x \ge 2$, assuming that the rank of $Γ$ is less than $r$, we give upper and lower bounds on the canonical height of a rational point $Q$ which is not in the group $Γ$ but belongs to the reduction of $Γ$ modulo every prime $p \le x$ of good reduction for $E$.
We obtain several asymptotic formulas for the sum of the divisor function $τ(n)$ with $n \le x$ in an arithmetic progressions $n \equiv a \pmod q$ on average over $a$ from a set of several consecutive elements from set of reduced residues modulo $q$ and on average over arbitrary sets. The main goal is to obtain nontrivial results for $q \ge x^{2/3}$ with the small amount of averaging over $a$. We recall that for individual values of $a$ the limit of our current methods is $q \le x^{2/3-\varepsilon}$ for an arbitrary fixed $\varepsilon> 0$. Our method builds on an approach due to Blomer (2008) based on the Voronoi summation formula which we combine with some recent results on bilinear sums of Kloosterman sums due Kowalski, Michel and Sawin (2017) and Shparlinski (2017). We also make use of extra applications of the Voronoi summation formulae after expanding into Kloosterman sums and this reduces the problem to estimating the number of solutions to multiplicative congruences.
We give an efficient algorithm to enumerate all sets of $r\ge 1$ quadratic polynomials over a finite field, which remain irreducible under iterations and compositions.
We study multiplicative dependence between elements in orbits ofalgebraic dynamical systems over number fields modulo a finitely generated multiplicative subgroup of the field. We obtain a series of results, many of which may be viewed as a blend of Northcott's theorem on boundedness of preperiodic points and Siegel's theorem on finiteness of solutions to $S$-unit equations.
We study the largest possible length $B$ of $(B-1)$-dimensional linear codes over $\mathbb{F}_q$ which can correct up to $t$ errors taken from a restricted set $\mathcal{A}\subseteq \mathbb{F}_q^*$. Such codes can be applied to multilevel flash memories. Moreover, in the case that $q=p$ is a prime and the errors are limited by a constant we show that often the primitive $\ell$th roots of unity, where $\ell$ is a prime divisor of $p-1$, define good such codes.
We obtain new bounds of exponential sums modulo a prime $p$ with binomials $ax^k + bx^n$. In particular, for $k=1$, we improve the bound of Karatsuba (1967) from $O(n^{1/4} p^{3/4})$ to $O\left(p^{3/4} + n^{1/3}p^{2/3}\right)$ for any $n$, and then use it to improve the bound of Akulinichev (1965) from $O(p^{5/6})$ to $O(p^{4/5})$ for $n | (p-1)$. The result is based on a new bound on the number of solutions and of degrees of irreducible components of certain equations over finite fields.
We obtain reasonably tight upper and lower bounds on the sum $\sum_{n \leqslant x} φ\left( \left\lfloor{x/n}\right\rfloor\right)$, involving the Euler functions $φ$ and the integer parts $\left\lfloor{x/n}\right\rfloor$ of the reciprocals of integers.
We obtain a new lower bound on the size of value set f(F_p) of a sparse polynomial f in F_p[X] over a finite field of p elements when p is prime. This bound is uniform with respect of the degree and depends on some natural arithmetic properties of the degrees of the monomial terms of f and the number of these terms. Our result is stronger than those which canted be extracted from the bounds on multiplicities of individual values in f(F_p).
A. Booker and C. Pomerance (2017) have shown that any residue class modulo a prime $p\ge 11$ can be represented by a positive $p$-smooth square-free integer $s = p^{O(\log p)}$ with all prime factors up to $p$ and conjectured that in fact one can find such $s$ with $s = p^{O(1)}$. Using bounds on double Kloosterman sums due to M. Z. Garaev (2010) we prove this conjecture in a stronger form $s \le p^{3/2 + o(1)}$ and also consider more general versions of this question replacing $p$-smoothness of $s$ by the stronger condition of $p^α$-smoothness. Using bounds on multiplicative character sums and a sieve method, we also show that we can represent all residue classes by a positive square-free integer $s\le p^{2+o(1)}$ which is $p^{1/(4e^{ /2})+o(1)}$-smooth. Additionally, we obtain stronger results for almost all primes $p$.
We obtain an improvement and broad generalisation of a result of N. Ailon and Z. Rudnick (2004) on common zeros of shifted powers of polynomials. Our approach is based on reducing this question to a more general question of counting intersections of level curves of complex functions. We treat this question via classical tools of complex analysis and algebraic geometry.