English
Related papers

Related papers: A robust version of Freiman's $3k-4$ Theorem and a…

200 papers

In this paper, we prove that the bound \[ \max \{ |8A-7A|,|5f(A)-4f(A)| \} \gg |A|^{\frac{3}{2} + \frac{1}{54}-o(1)} \] holds for all $A \subset \mathbb R$, and for all convex functions $f$ which satisfy an additional technical condition.…

Combinatorics · Mathematics 2023-04-04 Oliver Roche-Newton

By employing a weighted Frobenius norm with a positive matrix $\omega$, we introduce natural generalizations of the famous B\"ottcher-Wenzel (BW) inequality. Based on the combination of the weighted Frobenius norm $\|A\|_\omega :=…

Mathematical Physics · Physics 2024-12-30 Aina Mayumi , Gen Kimura , Hiromichi Ohno , Dariusz Chruściński

In this paper we associate with an infinite family of real extended functions defined on a locally convex space, a sum, called robust sum, which is always well-defined. We also associate with that family of functions a dual pair of problems…

Optimization and Control · Mathematics 2018-11-07 Nguyen Dinh , Miguel A. Goberna , Michel Volle

We show for $A,B\subset\mathbb{R}^d$ of equal volume and $t\in (0,1/2]$ that if $|tA+(1-t)B|< (1+t^d)|A|$, then (up to translation) $|\text{co}(A\cup B)|/|A|$ is bounded. This establishes the sharp threshold for Figalli and Jerison's…

Metric Geometry · Mathematics 2023-04-04 Peter van Hintum , Peter Keevash

The $3k-4$ conjecture in groups $\mathbb{Z}/p\mathbb{Z}$ for $p$ prime states that if $A$ is a nonempty subset of $\mathbb{Z}/p\mathbb{Z}$ satisfying $2A\neq \mathbb{Z}/p\mathbb{Z}$ and $|2A|=2|A|+r \leq \min\{3|A|-4,\;p-r-4\}$, then $A$ is…

Combinatorics · Mathematics 2020-11-17 Pablo Candela , Diego González-Sánchez , David J. Grynkiewicz

We formulate some refinements of Goldbach's conjectures based on heuristic arguments and numerical data. For instance, any even number greater than 4 is conjectured to be a sum of two primes with one prime being 3 mod 4. In general, for…

Number Theory · Mathematics 2022-05-05 Kimball Martin

Using the recent proof of the polynomial Freiman-Ruzsa conjecture over $\mathbb{F}_p^n$ by Gowers, Green, Manners, and Tao, we prove a version of the polynomial Freiman-Ruzsa conjecture over function fields. In particular, we prove that if…

Number Theory · Mathematics 2025-10-09 Thomas F. Bloom

Let $p$ be a prime greater than 3. In the paper we mainly determine $\sum_{k=0}^{[p/4]}\binom{4k}{2k}(-1)^k$, $\sum_{k=0}^{[p/3]}\binom{3k}k, \sum_{k=0}^{[p/3]}\binom{3k}k(-1)^k$ and $\sum_{k=0}^{[p/3]}\binom{3k}k(-3)^k$ modulo $p$, where…

Number Theory · Mathematics 2011-08-25 Zhi-Hong Sun

For a non-negative integer $m$, let $S(m)$ denote the sum given by $$S(m):=\sum_{n=0}^{m}\frac{(-1)^n(8n+1)}{n!^3}\left(\frac{1}{4}\right)_n^3.$$ Using the powerful WZ-method, for a prime $p\equiv 3$ $($mod $4)$ and an odd integer $r>1$, we…

Number Theory · Mathematics 2024-07-11 Arijit Jana , Gautam Kalita

The Riemann-Lebesque Theorem is commonly proved in a few strokes using the theory of Lebesque integration. Here, the upper bound $2\pi|c_k(f)|\le S_k(f)-s_k(f)$ for the Fourier coefficients $c_k$ is proved in terms of majoring and minoring…

funct-an · Mathematics 2008-02-03 Maurice H. P. M. van Putten

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 A be a subset of a group G = (G,.). We will survey the theory of sets A with the property that |A.A| <= K|A|, where A.A = {a_1 a_2 : a_1, a_2 in A}. The case G = (Z,+) is the famous Freiman--Ruzsa theorem.

Number Theory · Mathematics 2013-02-01 Emmanuel Breuillard , Ben Green , Terence Tao

Let $\boldsymbol{\alpha}\in \mathbb{R}^N$ and $Q\geq 1$. We consider the sum $\sum_{\boldsymbol{q}\in [-Q,Q]^N\cap\mathbb{Z}^N\backslash\{\boldsymbol{0}\}}\|\boldsymbol{\alpha}\cdot\boldsymbol{q}\|^{-1}$. Sharp upper bounds are known when…

Number Theory · Mathematics 2018-05-03 Reynold Fregoli

We reformulate the $3x+1$ conjecture by restricting attention to numbers congruent to $2$ (mod $3$). This leads to an equivalent conjecture for positive integers that reveals new aspects of the dynamics of the $3x+1$ problem. Advantages…

Number Theory · Mathematics 2020-09-24 Roger Zarnowski

We establish a correspondence between inverse sumset theorems (which can be viewed as classifications of approximate (abelian) groups) and inverse theorems for the Gowers norms (which can be viewed as classifications of approximate…

Number Theory · Mathematics 2015-05-13 Ben Green , Terence Tao

We show that whenever $s>k(k+1)$, then for any complex sequence $(\mathfrak a_n)_{n\in \mathbb Z}$, one has $$\int_{[0,1)^k}\left| \sum_{|n|\le N}\mathfrak a_ne(\alpha_1n+\ldots +\alpha_kn^k) \right|^{2s}\,{\rm d}{\mathbf \alpha}\ll…

Classical Analysis and ODEs · Mathematics 2024-07-01 Trevor D. Wooley

We produce congruences modulo a prime $p>3$ for sums $\sum_k\binom{3k}{k}x^k$ over ranges $0\le k<q$ and $0\le k<q/3$, where $q$ is a power of $p$. Here $x$ equals either $c^2/(1-c)^3$, or $4s^2/\bigl(27(s^2-1)\bigr)$, where $c$ and $s$ are…

Number Theory · Mathematics 2022-10-13 Sandro Mattarei , Roberto Tauraso

We prove that when $f$ is a Rademacher random multiplicative function for any $\epsilon>0$, then $\sum_{n \leqslant x}\frac{f(n)}{\sqrt{n}} \ll (\log\log(x))^{3/4+\epsilon}$ for almost all $f$. We also show that there exist arbitrarily…

Number Theory · Mathematics 2026-02-04 Christopher Atherfold

Motivated by the Polynomial Freiman-Ruzsa (PFR) Conjecture, we develop a theory of locality in sumsets, with applications to John-type approximation and sets with small doubling. First we show that if $A \subset \mathbb{Z}$ with $|A+A| \le…

Combinatorics · Mathematics 2024-03-05 Peter van Hintum , Peter Keevash

For any real $k\geq 2$ and large prime $q$, we prove a lower bound on the $2k$-th moment of the Dirichlet character sum \begin{equation*} \frac{1}{\phi(q)} \sum_{\substack{\chi \text{ mod }q\\ \chi\neq \chi_0}} \Big| \sum_{n\leq x}…

Number Theory · Mathematics 2024-09-23 Barnabás Szabó