中文
相关论文

相关论文: A short proof of Kneser's addition theorem for abe…

200 篇论文

Let $G$ be a $\sigma$-finite abelian group, i.e. $G=\bigcup_{n\geq 1} G_n$ where $(G_n)_{n\geq 1}$ is a non decreasing sequence of finite subgroups. For any $A\subset G$, let $\underline{\mathrm{d}}(A):=\liminf_{n\to\infty}\frac{|A\cap…

数论 · 数学 2021-01-06 Pierre-Yves Bienvenu , François Hennecart

Let $G = (G,+)$ be a compact connected abelian group, and let $\mu_G$ denote its probability Haar measure. A theorem of Kneser (generalising previous results of Macbeath and Raikov) establishes the bound $$ \mu_G(A + B) \geq \min(…

组合数学 · 数学 2018-07-03 Terence Tao

Let $G$ be an additive abelian group and let $A,B \subseteq G$ be finite and nonempty. The pair $(A,B)$ is called critical if the sumset $A+B = {a+b \mid $a \in A$ and $b\in B$}$ satisfies $|A+B| < |A| + |B|$. Vosper proved a theorem which…

组合数学 · 数学 2013-03-19 Tomas Boothby , Matt DeVos , Amanda Montejano

We give a new equivalent restatement and a new proof in terms of trios to the classical Kneser's theorem. In the finite case, our restatement takes the following, particularly symmetric shape: if $A$, $B$, and $C$ are subsets of a finite…

数论 · 数学 2016-02-09 David J. Grynkiewicz , Vsevolod F. Lev

We classify the pairs of subsets (A,B) of a locally compact abelian group satisfying m(A+B)=m(A)+m(B), where m is Haar measure. This generalizes a result of M. Kneser classifying such pairs under the additional assumption that G is compact…

组合数学 · 数学 2015-03-19 John T. Griesmer

A recent result of Balandraud shows that for every subset S of an abelian group G, there exists a non trivial subgroup H such that |TS| <= |T|+|S|-2 holds only if the stabilizer of TS contains H. Notice that Kneser's Theorem says only that…

数论 · 数学 2008-10-20 Yahya Ould Hamidoune , Oriol Serra , Gilles Zemor

A corollary of Kneser's theorem, one sees that any finite non-empty subset $A$ of an abelian group $G = (G,+)$ with $|A + A| \leq (2-\eps) |A|$ can be covered by at most $\frac{2}{\eps}-1$ translates of a finite group $H$ of cardinality at…

组合数学 · 数学 2012-04-04 Terence Tao

We characterize the pairs of sets $A, B$ in an arbitrary (countable or uncountable) discrete abelian group $\Gamma$ satisfying $\tilde{m}(A+B)<\tilde{m}(A)+\tilde{m}(B)$, where $\tilde{m}$ is an arbitrary finitely additive…

组合数学 · 数学 2026-02-24 John T. Griesmer

A classical result of Kemperman gives a complete recursive description of the structure of those subsets $A$ and $B$ of an abelian group that fail to satisfy the triangle inequality, i.e., $|A+B|<|A|+|B|$. In this paper, we achieve the…

组合数学 · 数学 2007-10-05 David J. Grynkiewicz

Let $G\cong \mathbb Z/m_1\mathbb Z\times\ldots\times \mathbb Z/m_r\mathbb Z$ be a finite abelian group with $m_1\mid\ldots\mid m_r=\exp(G)$. The Kemperman Structure Theorem characterizes all subsets $A,\,B\subseteq G$ satisfying…

数论 · 数学 2018-04-20 David J. Grynkiewicz

Let $G\cong \mathbb Z/m_1\mathbb Z\times\ldots\times \mathbb Z/m_r\mathbb Z$ be a finite abelian group with $m_1\mid\ldots\mid m_r=\exp(G)$. The $n$-term subsums version of Kneser's Theorem, obtained either via the DeVos-Goddyn-Mohar…

数论 · 数学 2017-09-28 David J. Grynkiewicz

We make further progress towards a Kneser-type generalization of Pollard's Theorem to general abelian groups. For two sets $A$ and $B$ in an abelian group $G$, the \emph{$t$-popular sumset} of $A$ and $B$, denoted by $A+_t B$, is the set of…

数论 · 数学 2026-01-27 David J. Grynkiewicz , Runze Wang

The paper deals with a problem of Additive Combinatorics. Let ${\mathbf G}$ be a finite abelian group of order $N$. We prove that the number of subset triples $A,B,C\subset {\mathbf G}$ such that for any $x\in A$, $y\in B$ and $z\in C$ one…

数论 · 数学 2020-12-29 Aliaksei Semchankau , Dmitry Shabanov , Ilya Shkredov

Let $G$ be an additive finite abelian group of order $n$, and let $S$ be a sequence of $n+k$ elements in $G$, where $k\geq 1$. Suppose that $S$ contains $t$ distinct elements. Let $\sum_n(S)$ denote the set that consists of all elements in…

数论 · 数学 2013-08-13 Xingwu Xia , Weidong Gao

A matching in a group G is a bijection f from a subset A to a subset B in G such that af(a) does not belong to A for all a in A. The group G is said to have the matching property if, for any finite subsets A,B in G of same cardinality with…

群论 · 数学 2007-05-23 Shalom Eliahou , Cedric Lecouvey

Let $G$ be an additive finite abelian group and let $k\in [\exp(G),\mathsf{D}(G)-1]$ be a positive integer. Denote by $\mathsf{s}_{\leq k}(G)$ the smallest positive integer $l\in \mathbb{N}\cup \{+\infty\}$ such that each sequence of length…

组合数学 · 数学 2025-06-27 Kevin Zhao

Let G be any additive abelian group with cyclic torsion subgroup, and let A, B and C be finite subsets of G with cardinality n>0. We show that there is a numbering {a_i}_{i=1}^n of the elements of A, a numbering {b_i}_{i=1}^n of the…

组合数学 · 数学 2008-12-04 Zhi-Wei Sun

A well-known result by Kemperman describes the structure of those pairs (A,B) of finite subsets of an abelian group satisfying |A+B|\le|A|+|B|-1. We establish a description which is, in a sense, dual to Kemperman's, and as an application…

数论 · 数学 2007-05-23 Vsevolod F. Lev

Let $G$ be a finite, non-trivial abelian group of exponent $m$, and suppose that $B_1, ..., B_k$ are generating subsets of $G$. We prove that if $k>2m \ln \log_2 |G|$, then the multiset union $B_1\cup...\cup B_k$ forms an additive basis of…

数论 · 数学 2008-12-16 Vsevolod F. Lev , Mikhail E. Muzychuk , Rom Pinchasi

In an abelian group G, a more sums than differences (MSTD) set is a subset A of G such that |A+A|>|A-A|. We provide asymptotics for the number of MSTD sets in finite abelian groups, extending previous results of Nathanson. The proof…

组合数学 · 数学 2015-10-26 Yufei Zhao
‹ 上一页 1 2 3 10 下一页 ›