中文
相关论文

相关论文: Sets with small sumset and rectification

200 篇论文

A famous result of Freiman describes the structure of finite sets A of integers with small doubling property. If |A + A| <= K|A| then A is contained within a multidimensional arithmetic progression of dimension d(K) and size f(K)|A|. Here…

数论 · 数学 2007-05-23 Ben Green , Imre Z. Ruzsa

Using various results from extremal set theory (interpreted in the language of additive combinatorics), we prove an asyptotically sharp version of Freiman's theorem in F_2^n: if A in F_2^n is a set for which |A + A| <= K|A| then A is…

组合数学 · 数学 2007-05-23 Ben Green , Terence Tao

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.

数论 · 数学 2013-02-01 Emmanuel Breuillard , Ben Green , Terence Tao

We show that a finite set of integers $A \subseteq \mathbb{Z}$ with $|A+A| \le K |A|$ contains a large piece $X \subseteq A$ with Fre\u{i}man dimension $O(\log K)$, where large means $|A|/|X| \ll \exp(O(\log^2 K))$. This can be thought of…

组合数学 · 数学 2016-06-06 Freddie Manners

We show that if A is a large subset of a box in Z^d with dimensions L_1 >= L_2 >= ... >= L_d which are all reasonably large, then |A + A| > 2^{d/48}|A|. By combining this with Chang's quantitative version of Freiman's theorem, we prove a…

数论 · 数学 2007-05-23 Ben Green

Let G be a finite abelian group of torsion r and let A be a subset of G. The Freiman--Ruzsa theorem asserts that if |A+A| < K|A| then A is contained in a coset of a subgroup of G of size at most r^{K^4}K^2|A|. It was conjectured by Ruzsa…

组合数学 · 数学 2018-06-07 Chaim Even-Zohar , Shachar Lovett

The study of sums of finite sets of integers has mostly concentrated on sets with small sumsets (Freiman's theorem and related work) and on sets with large sumsets (Sidon sets and $B_h$-sets). This paper considers the sets ${\mathcal…

数论 · 数学 2026-04-07 Melvyn B. Nathanson

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…

组合数学 · 数学 2022-04-22 Bela Bollobas , Imre Leader , Marius Tiba

Let A be a finite set of integers. We prove that if |A| is at least 2 and |A+A| is 3|A|-3, then one of the following is true: 1. A is a bi-arithmetic progression; 2. A+A contains an arithmetic progression of length 2|A|-1; 3. |A| is 6 and A…

数论 · 数学 2013-08-06 Renling Jin

Green and Ruzsa recently proved that for any $s\ge2$, any small squaring set $A$ in a (multiplicative) abelian group, i.e. $|A\cdot A|<K|A|$, has a Freiman $s$-model: it means that there exists a group $G$ and a Freiman $s$-isomorphism from…

数论 · 数学 2012-07-03 Norbert Hegyvári , François Hennecart

We prove a continuous Freiman's $3k-4$ theorem for small sumsets in $\mathbb{R}$ by using some ideas from Ruzsa's work on measure of sumsets in $\mathbb{R}$ as well as some graphic representation of density functions of sets. We thereby get…

组合数学 · 数学 2016-05-17 Anne de Roton

We show two results. First, a refinement of Freiman's theorem: if A is a finite set of integers and |A+A| < K|A|, then A is contained in a multidimensional progression of dimension at most O(K^{7/4} log^3K) and size at most exp(O(K^{7/4}…

经典分析与常微分方程 · 数学 2010-11-02 Tom Sanders

We show that if A is a subset of F_2^n and |A+A| < K|A| then A is contained in a subspace of size at most 2^{O(K^{3/2}log K)}|A|. This improves on the previous best of 2^{O(K^2)}.

数论 · 数学 2010-04-02 Tom Sanders

We prove a query complexity variant of the weak polynomial Freiman-Ruzsa conjecture in the following form. For any $\epsilon > 0$, a set $A \subset \mathbb{Z}^d$ with doubling $K$ has a subset of size at least $K^{-\frac{4}{\epsilon}}|A|$…

数论 · 数学 2022-01-14 Dmitrii Zhelezov , Dömötör Pálvölgyi

A conjecture of Freiman gives an exact formula for the largest volume of a finite set $A$ of integers with given cardinality $k = |A|$ and doubling $T = |2A|$. The formula is known to hold when $T \le 3k-4$, for some small range over $3k-4$…

数论 · 数学 2018-08-28 Gregory A. Freiman , Oriol Serra , Christoph Spiegel

One of the many theorems Freiman proved, in the second half of the twentieth century, in the subject which later came to be known as "structure theory of set addition", was 'Freiman's $3k-4$ theorem' for subsets of $\Z$. In this article we…

组合数学 · 数学 2017-08-22 R. Balasubramanian , Prem Prakash Pandey

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…

数论 · 数学 2007-05-23 I. D. Shkredov

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…

组合数学 · 数学 2023-06-07 Dmitry Krachun , Fedor Petrov

The basic theme of this paper is the fact that if $A$ is a finite set of integers, then the sum and product sets cannot both be small. A precise formulation of this fact is Conjecture 1 below due to Erd\H os-Szemer\'edi [E-S]. (see also…

组合数学 · 数学 2007-05-23 Mei-Chu Chang

Let $A$ be a finite set of $k$ integers. For $h \leq k$, the restricted $h$-fold sumset $h^{\wedge} A$ is the set of all sums of $h$ distinct elements of $A$. In additive combinatorics, much of the focus has traditionally been on finite…

组合数学 · 数学 2025-05-13 Debyani Manna , Mohan , Ram Krishna Pandey
‹ 上一页 1 2 3 10 下一页 ›