English
Related papers

Related papers: A step beyond Freiman's theorem for set addition m…

200 papers

Let $p$ a large enough prime number. When $A$ is a subset of $\mathbb{F}_p\smallsetminus\{0\}$ of cardinality $|A|> (p+1)/3$, then an application of Cauchy-Davenport Theorem gives $\mathbb{F}_p\smallsetminus\{0\}\subset A(A+A)$. In this…

Number Theory · Mathematics 2019-05-29 Pierre-Yves Bienvenu , François Hennecart , Ilya Shkredov

In 2014, Benjamin Nachman showed that when $p\equiv$1 mod 8, the 2-dimensional projective linear group over the field of $p$ elements fails the replacement property if the maximal length $m$ of an irredundant generating sequence for the…

Group Theory · Mathematics 2017-09-27 Hy P. G Lam

We prove algorithmic versions of the polynomial Freiman-Ruzsa theorem of Gowers, Green, Manners, and Tao (Annals of Mathematics, 2025) in additive combinatorics. In particular, we give classical and quantum polynomial-time algorithms that,…

Combinatorics · Mathematics 2025-09-03 Srinivasan Arunachalam , Davi Castro-Silva , Arkopal Dutt , Tom Gur

Let $p$ be a prime, and let $f(x)$ be an integer-valued polynomial. By a combinatorial approach, we obtain a nontrivial lower bound of the $p$-adic order of the sum $$\sum_{k=r(mod p^{\beta})}\binom{n}{k}(-1)^k f([(k-r)/p^{\alpha}]),$$…

Number Theory · Mathematics 2015-06-26 Zhi-Wei Sun

We prove that there is an absolute constant $c>0$ with the following property: if $Z/pZ$ denotes the group of prime order $p$, and a subset $A\subset Z/pZ$ satisfies $1<|A|<p/2$, then for any positive integer…

Number Theory · Mathematics 2009-12-04 Vsevolod F. Lev

We prove that the size of the product set of any finite arithmetic progression $\mathcal{A}\subset \mathbb{Z}$ satisfies \[|\mathcal A \cdot \mathcal A| \ge \frac{|\mathcal A|^2}{(\log |\mathcal A|)^{2\theta +o(1)} } ,\] where…

Number Theory · Mathematics 2023-07-26 Max Wenqiang Xu , Yunkun Zhou

We introduce a wide class of deterministic subsets of primes of zero relative density and we prove Roth's Theorem in these sets, namely, we show that any subset of them with positive relative upper density contains infinitely many…

Classical Analysis and ODEs · Mathematics 2023-01-02 Leonidas Daskalakis

Let $F : \mathrm{End}_{\mathbb{F_p}}(\mathbb{G}_{a/K}^d)$ be an additive polynomial mapping over a global function field $K/\mathbb{F}_q$, and let $P \in \mathbb{G}_a^d(K)$. Following Silverman, consider $\delta := \lim_{n \in \mathbb{N}}…

Number Theory · Mathematics 2015-11-13 Vesselin Dimitrov

We show that an arbitrary nilprogression can be approximated by a proper coset nilprogression in upper-triangular form. This can be thought of as a nilpotent version of the Freiman-Bilu result that a generalised arithmetic progression can…

Group Theory · Mathematics 2018-11-07 Romain Tessera , Matthew Tointon

In [5] Soare and Stob prove that if $A$ is an r.e. set which isn't computable then there is a set of the form $A \oplus W^A_e$ which isn't of r.e. Turing degree. If we define a properly $n+1$-REA set to be an $n+1$-REA set which isn't…

Logic · Mathematics 2022-12-20 Peter A. Cholak , Peter M. Gerdes

We discuss a statistical variant of Ruzsa's covering lemma and use it to show that if G is an Abelian group of bounded exponent and A in G has |A+A| < K|A| then the subgroup generated by A has size at most exp(O(K log^22K))|A|, where the…

Combinatorics · Mathematics 2016-10-25 Tom Sanders

We study the Generalized Fermat Equation $x^2 + y^3 = z^p$, to be solved in coprime integers, where $p \ge 7$ is prime. Using modularity and level lowering techniques, the problem can be reduced to the determination of the sets of rational…

Number Theory · Mathematics 2019-06-17 Nuno Freitas , Bartosz Naskrecki , Michael Stoll

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…

Combinatorics · Mathematics 2007-11-13 Ben Green , Terence Tao

In this paper we determine the number and typical structure of sets of integers with bounded doubling. In particular, improving recent results of Green and Morris, and of Mazur, we show that the following holds for every fixed $\lambda > 2$…

Combinatorics · Mathematics 2020-10-19 Marcelo Campos , Maurício Collares , Robert Morris , Natasha Morrison , Victor Souza

We extend Ueda's peak set theorem for subdiagonal subalgebras of tracial finite von Neumann algebras, to sigma-finite von Neumann algebras (that is, von Neumann algebras with a faithful state; which includes those on a separable Hilbert…

Operator Algebras · Mathematics 2018-08-09 David P. Blecher , Louis Labuschagne

For a set $A$ of $k$ elements from an additive abelian group $G$ and a positive integer $r \leq k$, we consider the set of elements of $G$ that can be written as a sum of $h$ elements of $A$ with at least $r$ distinct elements. We denote…

Combinatorics · Mathematics 2025-01-13 Jagannath Bhanja

In this paper we construct a cover {a_s(mod n_s)}_{s=1}^k of Z with odd moduli such that there are distinct primes p_1,...,p_k dividing 2^{n_1}-1,...,2^{n_k}-1 respectively. Using this cover we show that for any positive integer m divisible…

Number Theory · Mathematics 2008-11-29 Ke-Jian Wu , Zhi-Wei Sun

For a finite set of integers such that the first few gaps between its consecutive elements equal $a$, while the remaining gaps equal $b$, we study dense packings of its translates on the line. We obtain an explicit lower bound on the…

Combinatorics · Mathematics 2025-09-29 Alexander Natalchenko , Arsenii Sagdeev

Let $\mathbb{F}_p$ be the field of a prime order $p.$ It is known that for any integer $N\in [1,p]$ one can construct a subset $A\subset\mathbb{F}_p$ with $|A|= N$ such that $$ \max\{|A+A|, |AA|\}\ll p^{1/2}|A|^{1/2}. $$ In the present…

Number Theory · Mathematics 2007-06-06 M. Z. Garaev

Let $n>2r>0$ be integers. We consider families $\mathcal{F}$ of subsets of an $n$-element set, in which the union of any two members has size at most $2r$. One of our results states that for $n\geq 6r$ the number of members of size…

Combinatorics · Mathematics 2025-06-09 Peter Frankl , Jian Wang