中文
相关论文

相关论文: A probabilistic technique for finding almost-perio…

200 篇论文

We give new combinatorial proofs of known almost-periodicity results for sumsets of sets with small doubling in the spirit of Croot and Sisask, whose almost-periodicity lemma has had far-reaching implications in additive combinatorics. We…

离散数学 · 计算机科学 2019-06-14 Eli Ben-Sasson , Noga Ron-Zewi , Madhur Tulsiani , Julia Wolf

We prove results about the L^p-almost-periodicity of convolutions. One of these follows from a simple but rather general lemma about approximating a sum of functions in L^p, and gives a very short proof of a theorem of Green that if A and B…

数论 · 数学 2013-02-26 Ernie Croot , Izabella Laba , Olof Sisask

We extend previous work on Hrushovski's stabilizer's theorem and prove a measure-theoretic version of a well-known result of Pillay-Scanlon-Wagner on products of three types. This generalizes results of Gowers on products of three sets and…

逻辑 · 数学 2024-05-01 Amador Martin-Pizarro , Daniel Palacín

We develop a version of Freiman's theorem for a class of non-abelian groups, which includes finite nilpotent, supersolvable and solvable A-groups. To do this we have to replace the small doubling hypothesis with a stronger relative…

经典分析与常微分方程 · 数学 2012-12-04 Tom Sanders

The densities of small linear structures (such as arithmetic progressions) in subsets of Abelian groups can be expressed as certain analytic averages involving linear forms. Higher-order Fourier analysis examines such averages by…

数论 · 数学 2014-05-09 Hamed Hatami , Pooya Hatami , Shachar Lovett

The article presents several methods for the arithmetic of finite abelian groups. We introduce a tool - already used by Delsarte in [1] as I found out later - analogous to Dirichlet's convolution to obtain combinatorial results on these…

群论 · 数学 2023-05-04 Louis Mallet-Burgues

The bilinear Bogolyubov argument for $\mathbb{F}_p^n$ states that if we start with a dense set $A \subseteq \mathbb{F}_p^n \times \mathbb{F}_p^n$ and carry out sufficiently many steps where we replace every row or every column of $A$ by the…

组合数学 · 数学 2024-12-30 L. Milićević

In "Mordell-Lang plus Bogomolov", we formulated a conjecture combining the Mordell-Lang conjecture (now proven) and the Bogomolov conjecture, and proved the Mordellic part when A is almost split (i.e., isogenous to the product of an abelian…

数论 · 数学 2017-04-03 Bjorn Poonen

We extend to the case of semi-abelian varieties the statements of various variants of the conjecture alla Bogomolov about the non-density of small points of small height in abelian varieties. Inspired by recent work of Ullmo, Zhang and…

数论 · 数学 2007-05-23 Antoine Chambert-Loir

We give a structural description of the finite subsets $A$ of an arbitrary group $G$ which obey the polynomial growth condition $|A^n| \leq n^d |A|$ for some bounded $d$ and sufficiently large $n$, showing that such sets are controlled by…

组合数学 · 数学 2015-10-02 Terence Tao

We show that if a finite, large enough subset A of an arbitrary abelian group satisfies the small doubling condition |A + A| < (log |A|)^{1 - epsilon} |A|, then A must contain a three-term arithmetic progression whose terms are not all…

组合数学 · 数学 2016-02-24 Kevin Henriot

A result of Pyber states that every finite group $G$ contains an abelian subgroup whose order is quasi-polynomially large in $\lvert G\rvert$. We prove a similar result for $K$-approximate subgroups of solvable groups under only modest…

组合数学 · 数学 2025-12-18 Carl Schildkraut

A version of the Riesz-Sobolev convolution inequality is formulated and proved for arbitrary compact connected Abelian groups. Maximizers are characterized and a quantitative stability theorem is proved, under natural hypotheses. A…

经典分析与常微分方程 · 数学 2019-08-20 Michael Christ , Marina Iliopoulou

We give an efficient deterministic algorithm that outputs an expanding generating set for any finite abelian group. The size of the generating set is close to the randomized construction of Alon and Roichman (1994), improving upon various…

数据结构与算法 · 计算机科学 2021-05-05 Akhil Jalan , Dana Moshkovitz

The purpose of this note is to prove the existence of a remarkable structure in an iterated sumset derived from a set $P$ in a Cartesian square $\mathbb{F}_p^n\times\mathbb{F}_p^n$. More precisely, we perform horizontal and vertical sums…

组合数学 · 数学 2018-08-09 Pierre-Yves Bienvenu , Thái Hoàng Lê

We study a notion of VC-dimension for subsets of groups, defining this for a set $A$ to be the VC-dimension of the family $\{ (xA) \cap A : x \in A\cdot A^{-1} \}$. We show that if a finite subset $A$ of an abelian group has bounded…

组合数学 · 数学 2021-03-26 Olof Sisask

We prove Bogolyubov-Ruzsa-type results for finite subsets of groups with small tripling, $|A^3|\leq O(|A|)$, or small alternation, $|AA^{\text{-}1} A|\leq O(|A|)$. As applications, we obtain a qualitative analog of Bogolyubov's Lemma for…

组合数学 · 数学 2022-03-08 Gabriel Conant

We derive new explicit bounds for the total variation distance between two convolution products of $n$ probability distributions, one of which having identical convolution factors. Approximations by finite signed measures of arbitrary order…

概率论 · 数学 2008-11-06 Bero Roos

Let $A, B$, be finite subsets of an abelian group, and let $G \subset A \times B$ be such that $# A, # B, # \{a+b: (a,b) \in G \} \leq N$. We consider the question of estimating the quantity $# \{a-b: (a,b) \in G \}$. Recently Bourgain…

组合数学 · 数学 2007-05-23 Nets Hawk Katz , Terence Tao

We establish new bounds in the Bogolyubov-Ruzsa lemma, demonstrating that if A is a subset of a finite abelian group with density alpha, then 3A-3A contains a Bohr set of rank O(log^2 (2/alpha)) and radius Omega(log^{-2} (2/alpha)). The…

组合数学 · 数学 2023-11-10 Tomasz Kosciuszko , Tomasz Schoen
‹ 上一页 1 2 3 10 下一页 ›