Searcharxiv⌕ Search

arXiv subjects

Ilya D. Shkredov

Publications and source records attributed to Ilya D. Shkredov.

At least 37 records · Page 2Linked to original sources

On multiplicative Chung--Diaconis--Graham process

We study the lazy Markov chain on $\mathbf{F}_p$ defined as $X_{n+1}=X_n$ with probability $1/2$ and $X_{n+1}=f(X_n) \cdot \varepsilon_{n+1}$, where $\varepsilon_n$ are random variables distributed uniformly on $\{ γ^{}, γ^{-1}\}$, $γ$ is a primitive root and $f(x) = \frac{x}{x-1}$ or $f(x)=\mathrm{ind} (x)$. Then we show that the mixing time of $X_n$ is $\exp(O(\log p / \log \log p))$. Also, we obtain an application to an additive--combinatorial question concerning a certain Sidon--type family of sets.

math.CO↗

On an application of higher energies to Sidon sets

We show that for any finite set $A$ and an arbitrary $\varepsilon>0$ there is $k=k(\varepsilon)$ such that the higher energy ${\mathsf{E}}_k(A)$ is at most $|A|^{k+\varepsilon}$ unless $A$ has a very specific structure. As an application we obtain that any finite subset $A$ of the real numbers or the prime field either contains an additive Sidon--type subset of size $|A|^{1/2+c}$ or a multiplicative Sidon--type subset of size $|A|^{1/2+c}$.

math.NT↗

On multiplicative energy of subsets of varieties

We obtain a non--trivial upper bound for the multiplicative energy of any sufficiently large subset of a subvariety of a finite algebraic group. We also find some applications of our results to growth of conjugates classes, estimates of exponential sums and the restriction phenomenon.

math.CO↗

On some applications of GCD sums to Arithmetic Combinatorics

Using GCD sums, we show that the set of the primes has small common multiplicative energy with an arbitrary exponentially big integer set $S$ and, in particular, size of any arithmetic progression in $S$ having the beginning at zero, is at most $O(\log |S| \cdot \log \log |S|)$. This result can be considered as an integer analogue of Vinogradov's question about the least quadratic non--residue. The proof rests on a certain repulsion property of the function $f(x)=\log x$. Also, we consider the case of general $k$--convex functions $f$ and obtain a new incidence result for collections of the curves $y=f(x)+c$.

math.NT↗

On the distribution of modular square roots of primes

We use recent bounds on bilinear sums with modular square roots to study the distribution of solutions to congruences $x^2 \equiv p \pmod q$ with primes $p\le P$ and integers $q \le Q$. This can be considered as a combined scenario of Duke, Friedlander and Iwaniec with averaging only over the modulus $q$ and of Dunn, Kerr, Shparlinski and Zaharescu with averaging only over $p$.

math.NT↗

The Uniformity Conjecture in Additive Combinatorics

In this paper we show examples for applications of the Bombieri-Lang conjecture in additive combinatorics, giving bounds on the cardinality of sumsets of squares and higher powers of integers. Using similar methods we give bounds on the sum-product problem for matchings.

math.CO↗

On the spectral gap and the diameter of Cayley graphs

We obtain a new bound connecting the first non--trivial eigenvalue of the Laplace operator of a graph and the diameter of the graph, which is effective for graphs with small diameter or for graphs, having the number of maximal paths comparable to the expectation.

math.CO↗

$L$--functions and sum--free sets

For set $A\subset {\mathbb {F}_p}^*$ define by ${\mathsf{sf}}(A)$ the size of the largest sum--free subset of $A.$ Alon and Kleitman showed that ${\mathsf{sf}} (A) \ge |A|/3+O(|A|/p).$ We prove that if ${\mathsf{sf}} (A)-|A|/3$ is small then the set $A$ must be uniformly distributed on cosets of each large multiplicative subgroup. Our argument relies on irregularity of distribution of multiplicative subgroups on certain intervals in ${\mathbb {F}_p}$.

math.CO↗

Growth in Chevalley groups relatively to parabolic subgroups and some applications

Given a Chevalley group ${\mathbf G}(q)$ and a parabolic subgroup $P\subset {\mathbf G}(q)$, we prove that for any set $A$ there is a certain growth of $A$ relatively to $P$, namely, either $AP$ or $PA$ is much larger than $A$. Also, we study a question about intersection of $A^n$ with parabolic subgroups $P$ for large $n$. We apply our method to obtain some results on a modular form of Zaremba's conjecture from the theory of continued fractions and make the first step towards Hensley's conjecture about some Cantor sets with Hausdorff dimension greater than $1/2$.

math.NT↗

Bounds of Trilinear and Trinomial Exponential Sums

We prove, for a sufficiently small subset $\mathcal{A}$ of a prime residue field, an estimate on the number of solutions to the equation $(a_1-a_2)(a_3-a_4) = (a_5-a_6)(a_7-a_8)$ with all variables in $\mathcal{A}$. We then derive new bounds on trilinear exponential sums and on the total number of residues equaling the product of two differences of elements of $\mathcal{A}$. We also prove a refined estimate on the number of collinear triples in a Cartesian product of multiplicative subgroups and derive stronger bounds for trilinear sums with all variables in multiplicative subgroups.

math.CO↗

Sets of transfer times with small densities

We consider in this paper the set of transfer times between two measurable subsets of positive measures in an ergodic probability measure-preserving system of a countable abelian group. If the lower asymptotic density of the transfer times is small, then we prove this set must be either periodic or Sturmian. Our results can be viewed as ergodic-theoretical extensions of some classical sumset theorems in compact abelian groups due to Kneser. Our proofs are based on a correspondence principle for action sets which was developed previously by the first two authors.

math.DS↗

Small doubling in prime-order groups: from $2.4$ to $2.6$

Improving upon the results of Freiman and Candela-Serra-Spiegel, we show that for a non-empty subset $A\subseteq\mathbb F_p$ with $p$ prime and $|A|<0.0045p$, (i) if $|A+A|<2.59|A|-3$ and $|A|>100$, then $A$ is contained in an arithmetic progression of size $|A+A|-|A|+1$, and (ii) if $|A-A|<2.6|A|-3$, then $A$ is contained in an arithmetic progression of size $|A-A|-|A|+1$. The improvement comes from using the properties of higher energies.

math.NT↗

On popular sums and differences of sets with small products

Given a subset of real numbers $A$ with small product $AA$ we obtain a new upper bound for the additive energy of $A$. The proof uses a natural observation that level sets of convolutions of the characteristic function of $A$ have small product with $A$.

math.CO↗

On a modular form of Zaremba's conjecture

We prove that for any prime $p$ there is a divisible by $p$ number $q = O(p^{30})$ such that for a certain positive integer $a$ coprime with $q$ the ratio $a/q$ has bounded partial quotients. In the other direction we show that there is an absolute constant $C>0$ such that for any prime $p$ exist divisible by $p$ number $q = O(p^{C})$ and a number $a$, $a$ coprime with $q$ such that all partial quotients of the ratio $a/q$ are bounded by two.

math.NT↗

New results on sum-product type growth over fields

We prove a range of new sum-product type growth estimates over a general field $\mathbb{F}$, in particular the special case $\mathbb{F}=\mathbb{F}_p$. They are unified by the theme of "breaking the $3/2$ threshold", epitomising the previous state of the art. These estimates stem from specially suited applications of incidence bounds over $\mathbb{F}$, which apply to higher moments of representation functions. We establish the estimate $|R[A]| \gtrsim |A|^{8/5}$ for cardinality of the set $R[A]$ of distinct cross-ratios defined by triples of elements of a (sufficiently small if $\mathbb{F}$ has positive characteristic, similarly for the rest of the estimates) set $A\subset \mathbb{F}$, pinned at infinity. The cross-ratio naturally arises in various sum-product type questions of projective nature and is the unifying concept underlying most of our results. It enables one to take advantage of its symmetry properties as an onset of growth of, for instance, products of difference sets. The geometric nature of the cross-ratio enables us to break the version of the above threshold for the minimum number of distinct triangle areas $Ouu'$, defined by points $u,u'$ of a non-collinear point set $P\subset \mathbb{F}^2$. Another instance of breaking the threshold is showing that if $A$ is sufficiently small and has additive doubling constant $M$, then $|AA|\gtrsim M^{-2}|A|^{14/9}$. This result has a second moment version, which allows for new upper bounds for the number of collinear point triples in the set $A\times A\subset \mathbb{F}^2$, the quantity often arising in applications of geometric incidence estimates.

math.CO↗