arXiv subjects
Publications and source records attributed to Igor E. Shparlinski.
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.
In this paper, we study multiplicative dependence of values of polynomials or rational functions over a number field. As an application, we obtain new results on multiplicative dependence in the orbits of a univariate polynomial dynamical system. We also obtain a broad generalisation of the Northcott theorem replacing the finiteness of preperiodic points from a given number field by the finiteness of initial points with two multiplicatively dependent elements in their orbits.
We study the distribution of the sequence of elements of the discrete dynamical system generated by the Möbius transformation $x \mapsto (ax + b)/(cx + d)$ over a finite field of $p$ elements. Motivated by a recent conjecture of P. Sarnak, we obtain nontrivial estimates of exponential sums with such sequences that imply that trajectories of this dynamical system are disjoined with the Möbius function.
We obtain a new bound on certain double sums of multiplicative characters improving the range of several previous results. This improvement comes from new bounds on the number of collinear triples in finite fields, which is a classical object of study of additive combinatorics.
We obtain new results concerning the Sato-Tate conjecture on the distribution of Frobenius traces over single and double parametric families of elliptic curves. We consider these curves for values of parameters having prescribed arithmetic structure: product sets, geometric progressions, and most significantly prime numbers. In particular, some families are much thinner than the ones previously studied.
For a prime $p$ and a polynomial $F(X,Y)$ over a finite field $\mathbb{F}_p$ of $p$ elements, we give upper bounds on the number of solutions $$ F(x,y)=0, \quad x\in\mathcal{A}, \ y\in \mathcal{B}, $$ where $\mathcal{A}$ and $\mathcal{B}$ are very small intervals or subgroups. These bounds can be considered as positive characteristic analogues of the result of Bombieri and Pila (1989) on sparsity of integral points on curves. As an application we prove that distinct consecutive elements in sequences generated compositions of several rational functions are not contained in any short intervals or small subgroups.
We consider the problem of identity testing and recovering (that is, interpolating) of a "hidden" monic polynomials $f$, given an oracle access to $f(x)^e$ for $x\in\mathbb F_q$, where $\mathbb F_q$ is the finite field of $q$ elements and an extension fields access is not permitted. The naive interpolation algorithm needs $de+1$ queries, where $d =\max\{{\rm deg}\ f, {\rm deg }\ g\}$ and thus requires $ de<q$. For a prime $q = p$, we design an algorithm that is asymptotically better in certain cases, especially when $d$ is large. The algorithm is based on a result of independent interest in spirit of additive combinatorics. It gives an upper bound on the number of values of a rational function of large degree, evaluated on a short sequence of consecutive integers, that belong to a small subgroup of $\mathbb F_p^*$.
We show, under some natural conditions, that the set of abelian (and thus also cyclotomic) multiplicatively dependent points on an irreducible curve over a number field is a finite union of preimages of roots of unity by a certain finite set of primitive characters from $\Gm^n$ to $\Gm$ restricted to the curve, and a finite set. We also introduce the notion of primitive multiplicative dependence and obtain a finiteness result for primitively multiplicatively dependent points defined over a so-called Bogomolov extension of a number field.
In their recent work, the authors (2016) have combined classical ideas of A. G. Postnikov (1956) and N. M. Korobov (1974) to derive improved bounds on short character sums for certain nonprincipal characters with powerful moduli. In the present paper, these results are used to bound sums of the Mobius function twisted by characters of the same type, complementing and improving some earlier work of B. Green (2012). To achieve this, we obtain a series of results about the size and zero-free region of $L$-functions with the same class of moduli.
We give a new bound on colinear triples in subgroups of prime finite fields and use it to give some new bounds on exponential sums with trinomials.
We complement the argument of M. Z. Garaev (2009) with several other ideas to obtain a stronger version of the large sieve inequality with sparse exponential sequences of the form $λ^{s_n}$. In particular, we obtain a result which is non-trivial for monotonically increasing sequences $\cal{S}=\{s_n \}_{n=1}^{\infty}$ provided $s_n\le n^{2+o(1)}$, whereas the original argument of M. Z. Garaev requires $s_n \le n^{15/14 +o(1)}$ in the same setting. We also give an application of our result to arithmetic properties of integers with almost all digits prescribed.
For a positive integer $n$ let $\mathfrak{P}_n=\prod_{s_p(n)\ge p} p,$ where $p$ runs over all primes and $s_p(n)$ is the sum of the base $p$ digits of $n$. For all $n$ we prove that $\mathfrak{P}_n$ is divisible by all "small" primes with at most one exception. We also show that $\mathfrak{P}_n$ is large, has many prime factors exceeding $\sqrt{n}$, with the largest one exceeding $n^{20/37}$. We establish Kellner's conjecture, which says that the number of prime factors exceeding $\sqrt{n}$ grows asymptotically as $κ\sqrt{n}/\log n$ for some constant $κ$ with $κ=2$. Further, we compare the sizes of $\mathfrak{P}_n$ and $\mathfrak{P}_{n+1}$, leading to the somewhat surprising conclusion that although $\mathfrak{P}_n$ tends to infinity with $n$, the inequality $\mathfrak{P}_n>\mathfrak{P}_{n+1}$ is more frequent than its reverse.
We study functional graphs generated by quadratic polynomials over prime fields. We introduce efficient algorithms for methodical computations and provide the values of various direct and cumulative statistical parameters of interest. These include: the number of connected functional graphs, the number of graphs having a maximal cycle, the number of cycles of fixed size, the number of components of fixed size, as well as the shape of trees extracted from functional graphs. We particularly focus on connected functional graphs, that is, the graphs which contain only one component (and thus only one cycle). Based on the results of our computations, we formulate several conjectures highlighting the similarities and differences between these functional graphs and random mappings.
We use the large sieve inequality for smooth numbers due to S. Drappeau, A. Granville and X. Shao (2017), together with some other arguments, to improve their bounds on the frequency of pairs $(q,χ)$ of moduli $q$ and primitive characters $χ$ modulo $q$, for which the corresponding character sums with smooth numbers are large.
Consider the power pseudorandom-number generator in a finite field ${\mathbb F}_q$. That is, for some integer $e\ge2$, one considers the sequence $u,u^e,u^{e^2},\dots$ in ${\mathbb F}_q$ for a given seed $u\in {\mathbb F}_q^\times$. This sequence is eventually periodic. One can consider the number of cycles that exist as the seed $u$ varies over ${\mathbb F}_q^\times$. This is the same as the number of cycles in the functional graph of the map $x\mapsto x^e$ in ${\mathbb F}_q^\times$. We prove some estimates for the maximal and average number of cycles in the case of prime finite fields.
We improve the error terms of some estimates related to counting lattices from recent work of L. Fukshansky, P. Guerzhoy and F. Luca (2017). This improvement is based on some analytic techniques, in particular on bounds of exponential sums coupled with the use of Vaaler polynomials.
We give several families of reasonably small integers $k, \ell \ge 1$ and real positive $α, β\le 1$, such that the products $p_1\ldots p_k s$, where $p_1, \ldots, p_k \le m^α$ are primes and $s \le m^β$ is a product of at most $\ell$ primes, represent all reduced residue classes modulo $m$. This is a relaxed version of the still open question of P. Erdos, A. M. Odlyzko and A. Sarkozy (1987), that corresponds to $k = \ell =1$ (that is, to products of two primes). In particular, we improve recent results of A. Walker (2016).
We investigate two arithmetic functions naturally occurring in the study of the Euler and Carmichael quotients. The functions are related to the frequency of vanishing of the Euler and Carmichael quotients. We obtain several results concerning the relations between these functions as well as their typical and extreme values.