English
Related papers

Related papers: An improved bound on $(A+A)/(A+A)$

200 papers

Given a non-principal Dirichlet character chi mod q, an important problem in number theory is to obtain good estimates for the size of L(1,chi). In this paper we focus on sharpening the upper bounds known for |L(1,chi)|; in particular, we…

Number Theory · Mathematics 2007-05-23 Andrew Granville , Kannan Soundararajan

We study the extent to which sets A in Z/NZ, N prime, resemble sets of integers from the additive point of view (``up to Freiman isomorphism''). We give a direct proof of a result of Freiman, namely that if |A + A| < K|A| and |A| < c(K)N…

Number Theory · Mathematics 2007-05-23 Ben Green , Imre Z. Ruzsa

Given $d,s \in \mathbb{N}$, a finite set $A \subseteq \mathbb{Z}$ and polynomials $\varphi_1, \dots, \varphi_{s} \in \mathbb{Z}[x]$ such that $1 \leq deg \varphi_i \leq d$ for every $1 \leq i \leq s$, we prove that \[ |A^{(s)}| +…

Number Theory · Mathematics 2023-10-31 Akshat Mudgal

A cap set is a subset of $\mathbb{F}_3^n$ with no solutions to $x+y+z=0$ other than when $x=y=z$. In this paper, we provide a new lower bound on the size of a maximal cap set. Building on a construction of Edel, we use improved…

Combinatorics · Mathematics 2023-12-13 Fred Tyrrell

Let A and B be subsets of an elementary abelian 2-group G, none of which are contained in a coset of a proper subgroup. Extending onto potentially distinct summands a result of Hennecart and Plagne, we show that if |A+B|<|A|+|B|, then…

Combinatorics · Mathematics 2018-06-07 Chaim Even-Zohar , Vsevolod F. Lev

Let A be a finite subset of a commutative additive group Z. The sumset and difference set of A are defined as the sets of pairwise sums and differences of elements of A, respectively. The well-known inequality $\sigma(A)^{1/2} \leq…

Combinatorics · Mathematics 2015-10-20 Merlijn Staps

Let $\mathcal{A}$ be a union-closed family of sets with base set $b(\mathcal{A})=\bigcup_{A \in \mathcal{A}}A$ denoted by $[n]=\{1, \cdots, n\}$, and for any real $x>0$, let $\mathcal{A}_{<x} = \{A \in \mathcal{A} \ | \ |A| < x\}$. Also,…

Combinatorics · Mathematics 2025-09-17 Christopher Bouchard

We determine the limiting distribution of the family of values $\frac{L'}{L}(1/2+\epsilon,\chi_D)$ as $D$ varies over fundamental discriminants. Here, $0<\epsilon<\frac12$, and $\chi_D$ is the real character associated with $D$. Moreover,…

Number Theory · Mathematics 2022-04-19 Alia Hamieh , Rory McClenagan

Assuming the Riemann Hypothesis, we show that for $k>0$ $$ \frac{1}{T}\text{meas}\Big\{t\in [T,2T]:|\zeta(1/2+{\rm i} t)|>(\log T)^k\Big\}\leq C_k \frac{(\log T)^{-k^2}}{\sqrt{\log\log T}}, $$ where $C_k=\exp(e^{ck})$ for some absolute…

Number Theory · Mathematics 2026-04-29 Louis-Pierre Arguin , Emma Bailey , Asher Roberts

In its usual form, Freiman's 3k-4 theorem states that if A and B are subsets of the integers of size k with small sumset (of size close to 2k) then they are very close to arithmetic progressions. Our aim in this paper is to strengthen this…

Combinatorics · Mathematics 2022-04-22 Bela Bollobas , Imre Leader , Marius Tiba

Let $A\subset\left\{ 1,\dots,N\right\} $ be a set of prime numbers containing no non-trivial arithmetic progressions. Suppose that $A$ has relative density $\alpha=|A|/\pi(N)$, where $\pi(N)$ denotes the number of primes in the set $\left\{…

Number Theory · Mathematics 2019-02-20 Eric Naslund

We provide an improvement over Meshulam's bound on cap sets in $F_3^N$. We show that there exist universal $\epsilon>0$ and $C>0$ so that any cap set in $F_3^N$ has size at most $C {3^N \over N^{1+\epsilon}}$. We do this by obtaining quite…

Classical Analysis and ODEs · Mathematics 2011-04-05 Michael Bateman , Nets Hawk Katz

We show that if a compact set $E\subset \mathbb{R}^d$ has Hausdorff dimension larger than $\frac{d}{2}+\frac{1}{4}-\frac{1}{8d+4}$, where $d\geq 3$, then there is a point $x\in E$ such that the pinned distance set $\Delta_x(E)$ has positive…

Classical Analysis and ODEs · Mathematics 2024-10-23 Xiumin Du , Yumeng Ou , Kevin Ren , Ruixiang Zhang

M. Beck, J. De Loera, M. Develin, J. Pfeifle and R. Stanley found that the roots of the Ehrhart polynomial of a d-dimensional lattice polytope are bounded above in norm by 1+(d+1)!. We provide an improved bound which is quadratic in d and…

Combinatorics · Mathematics 2010-07-23 Benjamin Braun

We present a new advancement in the sum and difference of sets problem, which improves upon recent results by both DeepMind's AlphaEvolve ($\theta = 1.1584$) and subsequent explicit constructions ($\theta = 1.173050$). In this work, we…

Combinatorics · Mathematics 2025-06-03 Fan Zheng

We study different extended formulations for the set $X = \{x\in\mathbb{Z}^n \mid Ax = Ax^0\}$ in order to tackle the feasibility problem for the set $X_+=X \cap \mathbb{Z}^n_+$. Here the goal is not to find an improved polyhedral…

Optimization and Control · Mathematics 2007-05-23 Karen Aardal , Laurence A. Wolsey

The classical Cauchy--Davenport inequality gives a lower bound for the size of the sum of two subsets of ${\mathbb Z}_p$, where $p$ is a prime. Our main aim in this paper is to prove a considerable strengthening of this inequality, where we…

Combinatorics · Mathematics 2022-06-22 Bela Bollobas , Imre Leader , Marius Tiba

Let $G$ be a semisimple linear algebraic group over a field $k$ and let $G^+(k)$ be the subgroup generated by the subgroups $R_u(Q)(k)$, where $Q$ ranges over all the minimal $k$-parabolic subgroups $Q$ of $G$. We prove that if $G^+(k)$ is…

Group Theory · Mathematics 2022-03-01 Jarek Kędra , Assaf Libman , Ben Martin

Given a finite set of integers $A$, its sumset is $A+A:= \{a_i+a_j \mid a_i,a_j\in A\}$. We examine $|A+A|$ as a random variable, where $A\subset I_n = [0,n-1]$, the set of integers from 0 to $n-1$, so that each element of $I_n$ is in $A$…

A set of reals $A=\{a_1,...,a_n\}$ labeled in increasing order is called convex if there exists a continuous strictly convex function $f$ such that $f(i)=a_i$ for every $i$. Given a convex set $A$, we prove…

Combinatorics · Mathematics 2011-08-23 Liangpan Li
‹ Prev 1 8 9 10 Next ›