Searcharxiv⌕ Search

arXiv subjects

Igor Shparlinski

Publications and source records attributed to Igor Shparlinski.

At least 37 records · Page 2Linked to original sources

Kloosterman paths of prime powers moduli, II

G. Ricotta and E. Royer (2018) have recently proved that the polygonal paths joining the partial sums of the normalized classical Kloosterman sums $S(a,b;p^n)/p^(n/2) converge in law in the Banach space of complex-valued continuous function on [0,1] to an explicit random Fourier series as (a,b) varies over (Z/p^nZ)^\times\times(Z/p^nZ)^\times, p tends to infinity among the odd prime numbers and n>=2 is a fixed integer. This is the analogue of the result obtained by E. Kowalski and W. Sawin (2016) in the prime moduli case. The purpose of this work is to prove a convergence law in this Banach space as only a varies over (Z/p^nZ)^\times, p tends to infinity among the odd prime numbers and n>=31 is a fixed integer.

math.NT↗

Analogues of the Balog--Wooley Decomposition for Subsets of Finite Fields and Character Sums with Convolutions

Balog and Wooley have recently proved that any subset $A$ of either real numbers or of a prime finite field can be decomposed into two parts $U$ and $V$, one of small additive energy and the other of small multiplicative energy. In the case of arbitrary finite fields, we obtain an analogue that under some natural restrictions for a rational function $f$ both the additive energies of $U$ and $f(V)$ are small. Our method is based on bounds of character sums which leads to the restriction $\# A > q^{1/2}$ where $q$ is the field size. The bound is optimal, up to logarithmic factors, when $\# A \geq q^{9/13}$. Using $f(X)=X^{-1}$ we apply this result to estimate some triple additive and multiplicative character sums involving three sets with convolutions $ab+ac+bc$ with variables $a,b,c$ running through three arbitrary subsets of a finite field.

math.NT↗

Bounds on short character sums and L-functions for characters with a smooth modulus

We combine a classical idea of Postnikov (1956) with the method of Korobov (1974) for estimating double Weyl sums, deriving new bounds on short character sums when the modulus $q$ has a small core $\prod_{p\mid q}p$. Using this estimate, we improve certain bounds of Gallagher (1972) and Iwaniec (1974) for the corresponding $L$-functions. In turn, this allows us to improve the error term in the asymptotic formula for primes in short arithmetic progressions modulo a power of a fixed prime. As yet another application of our bounds, we substantially extend the region free of Siegel zeros.

math.NT↗

Polynomial Interpolation and Identity Testing from High Powers over Finite Fields

We consider the problem of recovering (that is, interpolating) and identity testing of a "hidden" monic polynomial $f$, given an oracle access to $f(x)^e$ for $x\in{\mathbb F_q}$ (extension fields access is not permitted). The naive interpolation algorithm needs $O(e\, \mathrm{deg}\, f)$ queries and thus requires $e\, \mathrm{deg}\, f<q$. We design algorithms that are asymptotically better in certain cases; requiring only $e^{o(1)}$ queries to the oracle. In the randomized (and quantum) setting, we give a substantially better interpolation algorithm, that requires only $O(\mathrm{deg}\, f \log q)$ queries. Such results have been known before only for the special case of a linear $f$, called the hidden shifted power problem. We use techniques from algebra, such as effective versions of Hilbert's Nullstellensatz, and analytic number theory, such as results on the distribution of rational functions in subgroups and character sum estimates.

math.NT↗

Congruences with intervals and subgroups modulo a prime

We obtain new results about the representation of almost all residues modulo a prime $p$ by a product of a small integer and also an element of small multiplicative subgroup of $({\mathbb Z}/p{\mathbb Z})^*$. These results are based on some ideas, and their modifications, of a recent work of J. Cilleruelo and M. Z. Garaev (2014),

math.NT↗

Polynomial Values in Subfields and Affine Subspaces of Finite Fields

For an integer $r$, a prime power $q$, and a polynomial $f$ over a finite field ${\mathbb F}_{q^r}$ of $q^r$ elements, we obtain an upper bound on the frequency of elements in an orbit generated by iterations of $f$ which fall in a proper subfield of ${\mathbb F}_{q^r}$. We also obtain similar results for elements in affine subspaces of ${\mathbb F}_{q^r}$, considered as a linear space over ${\mathbb F}_q$.

math.NT↗

On the Fixed Points of the Map x -> x^x Modulo a Prime

In this paper, we show that for almost all primes p there is an integer solution x in [2,p-1] to the congruence x^x == x mod p. The solutions can be interpretated as fixed points of the map x -> x^x mod p, and we study numerically and discuss some unexpected properties of the dynamical system associated with this map.

math.NT↗

Multiple Exponential and Character Sums with Monomials

We obtain new bounds of multivariate exponential sums with monomials, when the variables run over rather short intervals. Furthermore, we use the same method to derive estimates on similar sums with multiplicative characters to which previously known methods do not apply. In particular, in the multiplicative characters modulo a prime $p$ we break the barrier of $p^{1/4}$ for ranges of individual variables.

math.NT↗

Averaging operators over homogeneous varieties over finite fields

In this paper we study the mapping properties of the averaging operator over a variety given by a system of homogeneous equations over a finite field. We obtain optimal results on the averaging problems over two dimensional varieties whose elements are common solutions of diagonal homogeneous equations. The proof is based on a careful study of algebraic and geometric properties of such varieties. In particular, we show that they are not contained in any hyperplane and are complete intersections. We also address partial results on averaging problems over arbitrary dimensional homogeneous varieties which are smooth away from the origin.

math.FA↗

Additive Decompositions of Subgroups of Finite Fields

We say that a set $S$ is additively decomposed into two sets $A$ and $B$, if $S = \{a+b : a\in A, \ b \in B\}$. Here we study additively decompositions of multiplicative subgroups of finite fields. In particular, we give some improvements and generalisations of results of C. Dartyge and A. Sarkozy on additive decompositions of quadratic residues and primitive roots modulo $p$. We use some new tools such the Karatsuba bound of double character sums and some results from additive combinatorics.

math.NT↗

On the Product of Small Elkies Primes

Given an elliptic curve $E$ over a finite field $\F_q$ of $q$ elements, we say that an odd prime $\ell \nmid q$ is an Elkies prime for $E$ if $t_E^2 - 4q$ is a quadratic residue modulo $\ell$, where $t_E = q+1 - #E(\F_q)$ and $#E(\F_q)$ is the number of $\F_q$-rational points on $E$. These primes are used in the presently most efficient algorithm to compute $#E(\F_q)$. In particular, the bound $L_q(E)$ such that the product of all Elkies primes for $E$ up to $L_q(E)$ exceeds $4q^{1/2}$ is a crucial parameter of this algorithm. We show that there are infinitely many pairs $(p, E)$ of primes $p$ and curves $E$ over $\F_p$ with $L_p(E) \ge c \log p \log \log \log p$ for some absolute constant $c>0$, while a naive heuristic estimate suggests that $L_p(E) \sim \log p$. This complements recent results of Galbraith and Satoh (2002), conditional under the Generalised Riemann Hypothesis, and of Shparlinski and Sutherland (2012), unconditional for almost all pairs $(p,E)$.

math.NT↗

On Congruences with Products of Variables from Short Intervals and Applications

We obtain upper bounds on the number of solutions to congruences of the type $$ (x_1+s)...(x_ν+s)\equiv (y_1+s)...(y_ν+s)\not\equiv0 \pmod p $$ modulo a prime $p$ with variables from some short intervals. We give some applications of our results and in particular improve several recent estimates of J. Cilleruelo and M. Z. Garaev on exponential congruences and on cardinalities of products of short intervals, some double character sum estimates of J. B. Friedlander and H. Iwaniec and some results of M.-C. Chang and A. A. Karatsuba on character sums twisted with the divisor function.

math.NT↗

Degree Growth, Linear Independence and Periods of a Class of Rational Dynamical Systems

We introduce and study algebraic dynamical systems generated by triangular systems of rational functions. We obtain several results about the degree growth and linear independence of iterates as well as about possible lengths of trajectories generated by such dynamical systems over finite fields. Some of these results are generalisations of those known in the polynomial case, some are new even in this case.

math.NT↗

Distribution on elements of cosets of small subgroups and applications

We obtain a series of estimates on the number of small integers and small order Farey fractions which belong to a given coset of a subgroup of order $t$ of the group of units of the residue ring modulo a prime $p$, in the case when $t$ is small compared to $p$. We give two applications of these results: to the simultaneous distribution of two high degree monomials $x^{k_1}$ and $x^{k_2}$ modulo $p$ and to a question of J.Holden and P.Moree on fixed points of the discrete logarithm.

math.NT↗