English
Related papers

Related papers: Improved Bounds for the Freiman-Ruzsa Theorem

200 papers

It is proved that the Continuum Hypothesis implies that any sequence of rapid P-points of length $<{\mathfrak c}^{+}$ which is increasing with respect to the Rudin-Keisler ordering is bounded above by a rapid P-point. This is an improvement…

Logic · Mathematics 2019-02-14 Dilip Raghavan , Jonathan L. Verner

We answer a question of Darji and Keleti by proving that there exists a compact set $C_0\subset\RR$ of measure zero such that for every perfect set $P\subset\RR$ there exists $x\in\RR$ such that $(C_0+x)\cap P$ is uncountable. Using this…

Logic · Mathematics 2011-09-27 Márton Elekes , Juris Steprāns

Babai's conjecture states that, for any finite simple non-abelian group $G$, the diameter of $G$ is bounded by $(\log|G|)^{C}$ for some absolute constant $C$. We prove that, for any untwisted classical group $G$ of rank $r$ defined over a…

Group Theory · Mathematics 2024-12-16 Jitendra Bajpai , Daniele Dona , Harald Andrés Helfgott

Given a number field $F_0$ that contains no Hilbert class field of any imaginary quadratic field, we show that under GRH there exists an effectively computable constant $B:=B(F_0)\in\mathbb{Z}^+$ for which the following holds: for any…

Number Theory · Mathematics 2024-07-30 Tyler Genao

Let $K\subset \mathbb R$ be a regular compact set and let $g(z)=g_{\overline{\mathbb C}\setminus K}(z,\infty)$ be the Green function for $\overline{\mathbb C}\setminus K$ with pole at infinity. For $\delta>0$, define $$ G(\delta):=\max\{…

Classical Analysis and ODEs · Mathematics 2021-11-09 Vladimir Andrievskii , Fedor Nazarov

Let F be a family of positive homothets (or translates) of a given convex body K in R^n. We investigate two approaches to measuring the complexity of F. First, we find an upper bound on the transversal number $\tau(F)$ of F in terms of $n$…

Metric Geometry · Mathematics 2010-04-09 Márton Naszódi , Steven Taschuk

Let G be a finite Abelian group and A be a subset G\times G of cardinality at least |G|^2/(log log |G|)^c, where c>0 is an absolute constant. We prove that A contains a triple {(k,m), (k+d,m), (k,m+d)}, where d does not equal 0. This…

Number Theory · Mathematics 2007-05-23 I. D. Shkredov

We present a short, self-contained, and purely combinatorial proof of Linnik's theorem: for any $\varepsilon > 0$ there exists a constant $C_\varepsilon$ such that for any $N$, there are at most $C_\varepsilon$ primes $p \leqslant N$ such…

Number Theory · Mathematics 2017-12-21 Paul Balister , Béla Bollobás , Jonathan D. Lee , Robert Morris , Oliver Riordan

For a finite abelian group $(G,+)$, the constant $C(G)$ is defined to be the smallest natural number $k$ such that any sequence in $G$ having length $k$ will have a subsequence of consecutive terms whose sum is zero. For a subset…

Number Theory · Mathematics 2023-02-07 Santanu Mondal , Krishnendu Paul , Shameek Paul

We show that for some constant $\beta > 0$, any subset $A$ of integers $\{1,\ldots,N\}$ of size at least $2^{-O((\log N)^\beta)} \cdot N$ contains a non-trivial three-term arithmetic progression. Previously, three-term arithmetic…

Number Theory · Mathematics 2024-10-30 Zander Kelley , Raghu Meka

Denoting by Sigma(S) the set of subset sums of a subset S of a finite abelian group G, we prove that |Sigma(S)| >= |S|(|S|+2)/4-1 whenever S is symmetric, |G| is odd and Sigma(S) is aperiodic. Up to an additive constant of 2 this result is…

Combinatorics · Mathematics 2014-07-01 Eric Balandraud , Benjamin Girard , Simon Griffiths , Yahya Ould Hamidoune

We provide optimal upper bounds on the growth of iterated sumsets $hA=A+\dots+A$ for finite subsets $A$ of abelian semigroups. More precisely, we show that the new upper bounds recently derived from Macaulay's theorem in commutative algebra…

Commutative Algebra · Mathematics 2023-10-17 Shalom Eliahou , Eshita Mazumdar

We show that if $A\subset \{1,\ldots,N\}$ has no solutions to $a-b=n^2$ with $a,b\in A$ and $n\geq 1$ then \[|A|\ll \frac{N}{(\log N)^{c\log\log \log N}}\] for some absolute constant $c>0$. This improves upon a result of…

Number Theory · Mathematics 2021-02-25 Thomas F. Bloom , James Maynard

The polynomial Fre\u{\i}man--Ruzsa conjecture is a fundamental open question in additive combinatorics. However, over the integers (or more generally $\mathbb{R}^d$ or $\mathbb{Z}^d$) the optimal formulation has not been fully pinned down.…

Number Theory · Mathematics 2017-09-29 Freddie Manners

Itsykson and Sokolov [IS14] identified resolution over parities, denoted by $\text{Res}(\oplus)$, as a natural and simple fragment of $\text{AC}^0[2]$-Frege for which no super-polynomial lower bounds on size of proofs are known. Building on…

Computational Complexity · Computer Science 2025-12-09 Sreejata Kishor Bhattacharya , Arkadev Chattopadhyay

Given a sequence $\mathscr{A}=\{a_0<a_1<a_2\ldots\}\subseteq \mathbb{N}$, let $r_{\mathscr{A},h}(n)$ denote the number of ways $n$ can be written as the sum of $h$ elements of $\mathscr{A}$. Fixing $h\geq 2$, we show that if $f$ is a…

Combinatorics · Mathematics 2024-12-18 Christian Táfula

Let $K$ and $k$ be $p$-adic fields. Let $L$ be the composite field of $K$ and a certain Lubin-Tate extension over $k$ (including the case where $L=K(\mu_{p^{\infty}})$). In this paper, we show that there exists an explicitly described…

Number Theory · Mathematics 2024-07-24 Yoshiyasu Ozeki

We study the convolution of functions of the form \[ f_\alpha (z) := \dfrac{\left( \frac{1 + z}{1 - z} \right)^\alpha - 1}{2 \alpha}, \] which map the open unit disk of the complex plane onto polygons of 2 edges when $\alpha\in(0,1)$. We…

Complex Variables · Mathematics 2024-10-29 Martin Chuaqui , Rodrigo Hernández , Adrián Llinares , Alejandro Mas

Let $F$ be a finite field of odd characteristic. We prove that any set $A\subset F$ with $|A|\geq C|F|^{5/6}$ contains a nontrivial quadratic progression $(x, x+y, x+y^2), y\neq 0.$ For prime fields, this improves the previous best-known…

Number Theory · Mathematics 2026-05-01 Mark Lewko

We prove that the crossing number of a graph decays in a continuous fashion in the following sense. For any epsilon>0 there is a delta>0 such that for a sufficiently large n, every graph G with n vertices and m > n^{1+epsilon} edges, has a…

Combinatorics · Mathematics 2013-08-07 Jakub Černý , Jan Kynčl , Géza Tóth