Searcharxiv⌕ Search

arXiv subjects

Ilya D. Shkredov

Publications and source records attributed to Ilya D. Shkredov.

83 records · Page 5Linked to original sources

Quantitative version of Beurling-Helson theorem

It is proved that any continuous function f on the unit circle such that the sequence e^{in f}, n=1,2,... has small Wiener norm \| e^{in f} \|_A = o (\frac{\log^{1/22} |n|}{(\log \log |n|)^{3/11}}), is linear. Moreover, we get lower bounds for Wiener norm of characteristic functions of subsets from Z_p in the case of prime p.

math.CA↗

Variations on the Sum-Product Problem

This paper considers various formulations of the sum-product problem. It is shown that, for a finite set $A\subset{\mathbb{R}}$, $$|A(A+A)|\gg{|A|^{\frac{3}{2}+\frac{1}{178}}},$$ giving a partial answer to a conjecture of Balog. In a similar spirit, it is established that $$|A(A+A+A+A)|\gg{\frac{|A|^2}{\log{|A|}}},$$ a bound which is optimal up to constant and logarithmic factors. We also prove several new results concerning sum-product estimates and expanders, for example, showing that $$|A(A+a)|\gg{|A|^{3/2}}$$ holds for a typical element of $A$.

math.CO↗

On exponential sums over multiplicative subgroups of medium size

In the paper we obtain some new upper bounds for exponential sums over multiplicative subgroups G of F^*_p having sizes in the range [p^{c_1}, p^{c_2}], where c_1,c_2 are some absolute constants close to 1/2. As an application we prove that in symmetric case G is always an additive basis of order five, provided by |G| > p^{1/2} log^{1/3} p. Also the method allows us to give a new upper bound for Heilbronn's exponential sum.

math.NT↗

Sumsets in quadratic residues

We describe all sets $A \subseteq \F_p$ which represent the quadratic residues $R \subseteq \F_p$ as $R=A+A$ and $R=A\hat{+} A$. Also, we consider the case of an approximate equality $R \approx A+A$ and $R \approx A\hat{+} A$ and prove that $A$ has a structure in the situation.

math.NT↗

Some new results on higher energies

In the paper we develop the method of higher energies. New upper bounds for the additive energies of convex sets, sets A with small |AA| and |A(A+1)| are obtained. We prove new structural results, including higher sumsets, and develop the notion of dual popular difference sets.

math.CO↗

Higher moments of convolutions

We study higher moments of convolutions of the characteristic function of a set, which generalize a classical notion of the additive energy. Such quantities appear in many problems of additive combinatorics as well as in number theory. In our investigation we use different approaches including basic combinatorics, Fourier analysis and eigenvalues method to establish basic properties of higher energies. We provide also a sequence of applications of higher energies additive combinatorics.

math.CO↗

On Heilbronn's exponential sum

In the paper we prove a new upper bound for Heilbronn's exponential sum and obtain some applications of our result to distribution of Fermat quotients.

math.NT↗

Roth's theorem in many variables

We prove, in particular, that if a subset A of {1, 2,..., N} has no nontrivial solution to the equation x_1+x_2+x_3+x_4+x_5=5y then the cardinality of A is at most N e^{-c(log N)^{1/7-eps}}, where eps>0 is an arbitrary number, and c>0 is an absolute constant. In view of the well-known Behrend construction this estimate is close to best possible.

math.NT↗

On sumsets of convex sets

A set of reals A={a_1,...,a_2} is called convex if a_{i+1} - a_i > a_i - a_{i-1} for all i. We prove, in particular, that |A-A| \gg |A|^{8/5} \log{-2/5} |A|.

math.CO↗