相关论文: On an almost all version of the Balog-Szemeredi-Go…

We prove that every additive set $A$ with energy $E(A)\ge |A|^3/K$ has a subset $A'\subseteq A$ of size $|A'|\ge (1-\varepsilon)K^{-1/2}|A|$ such that $|A'-A'|\le O_\varepsilon(K^{4}|A'|)$. This is, essentially, the largest structured set…

Let $A$ be a finite subset of an abelian group $G$, and suppose that $|A+A|\leq K|A|$. We show that for any $\epsilon>0$, there exists a constant $C_\epsilon$ such that $A$ can be covered by at most $\exp(C_\epsilon \log(2K)^{1+\epsilon})$…

In this note, we obtain a quantitative improvement on the hypergraph variant of the Balog-Szemer\'{e}di-Gowers theorem due to Sudakov, Szemer\'{e}di, and Vu [Duke Math. J.129.1 (2005): 129--155]. Additionally, we prove the hypergraph…

The main result of this paper is that for any $1/2 \leq s < 2 - \sqrt{2} \approx 0.5858$, there is a number $\sigma = \sigma(s) < s$ with the following property. Let $\delta > 0$ be small, assume that $A \subset [0,1]$ is a…

A celebrated result of Gowers states that for every \epsilon > 0 there is a graph G so that every \epsilon-regular partition of G (in the sense of Szemeredi's regularity lemma) has order given by a tower of exponents of height polynomial in…

The clique removal lemma says that for every $r \geq 3$ and $\varepsilon>0$, there exists some $\delta>0$ so that every $n$-vertex graph $G$ with fewer than $\delta n^r$ copies of $K_r$ can be made $K_r$-free by removing at most…

We prove the following version of the Loebl-Komlos-Sos Conjecture: For every alpha>0 there exists a number M such that for every k>M every n-vertex graph G with at least (0.5+alpha)n vertices of degree at least (1+alpha)k contains each tree…

We show that if G is a group and A is a finite subset of G with |A^2| < K|A|, then for all k there is a symmetric neighbourhood of the identity S with S^k a subset of A^2A^{-2} and |S| > exp(-K^{O(k)})|A|.

The graph removal lemma is a fundamental result in extremal graph theory which says that for every fixed graph $H$ and $\varepsilon > 0$, if an $n$-vertex graph $G$ contains $\varepsilon n^2$ edge-disjoint copies of $H$ then $G$ contains…

We obtain quantitative versions of the Balog-Szemeredi-Gowers and Freiman theorems in the model case of a finite field geometry F_2^n, improving the previously known bounds in such theorems. For instance, if A is a subset of F_2^n such that…

Let $G$ be a graph with degree sequence $d_1\geq \ldots \geq d_n$. Slater proposed $s\ell(G)=\min\{ s: (d_1+1)+\cdots+(d_s+1)\geq n\}$ as a lower bound on the domination number $\gamma(G)$ of $G$. We show that deciding the equality of…

Improving upon a technique of Croot and Hart, we show that for every $h$, there exists an $\epsilon > 0$ such that if $A \subseteq \mathbb{R}$ is sufficiently large and $|A.A| \le |A|^{1+\epsilon}$, then $|hA| \ge…

We give a generalization of the classical Bombieri--Schneider--Lang criterion in transcendence theory. We give a local notion of $LG$--germ, which is similar to the notion of $E$-- function and Gevrey condition, and which generalize (and…

A result of Simonovits and S\'os states that for any fixed graph $H$ and any $\epsilon > 0$ there exists $\delta > 0$ such that if $G$ is an $n$-vertex graph with the property that every $S \subseteq V(G)$ contains $p^{e(H)} |S|^{v(H)} \pm…

For a finite set $A\subset \mathbb{R}$ and real $\lambda$, let $A+\lambda A:=\{a+\lambda b :\, a,b\in A\}$. Combining a structural theorem of Freiman on sets with small doubling constants together with a discrete analogue of…

Let G be an arbitrary Abelian group and let A be a finite subset of G. A has small additive doubling if |A+A| < K|A| for some K>0. These sets were studied in papers of G.A. Freiman, Y. Bilu, I. Ruzsa, M.C.--Chang, B. Green and T.Tao. In the…

We show that there is an absolute constant $c>0$ such that $|A+\lambda\cdot A|\geq e^{c\sqrt{\log |A|}}|A|$ for any finite subset $A$ of $\mathbb{R}$ and any transcendental number $\lambda\in\mathbb{R}$. By a construction of Konyagin and…

A famous theorem of Szemer\'edi asserts that given any density $0 < \delta \leq 1$ and any integer $k \geq 3$, any set of integers with density $\delta$ will contain infinitely many proper arithmetic progressions of length $k$. For general…

We establish a new version of Siegel's lemma over a number field $k$, providing a bound on the maximum of heights of basis vectors of a subspace of $k^N$, $N \geq 2$. In addition to the small-height property, the basis vectors we obtain…

We obtain polylogarithmic bounds in the polynomial Szemer\'{e}di theorem when the polynomials have distinct degrees and zero constant terms. Specifically, let $P_1, \dots, P_m \in \mathbb Z[y]$ be polynomials with distinct degrees, each…