English
Related papers

Related papers: A note on Pollard's Theorem

200 papers

We show that if $G$ is a finite Abelian group and $f$ is an integer-valued map on $G$ with algebra norm at most $M$ then there is some $L < \exp(M^{4+o(1)})$, cosets of (possibly different) subgroups $W_1,...,W_L$, and $s_1,...,s_L \in…

Classical Analysis and ODEs · Mathematics 2020-08-18 Tom Sanders

Let $G$ be a nonabelian group and $n$ a natural number. We say that $G$ has a strict $n$-split decomposition if it can be partitioned as the disjoint union of an abelian subgroup $A$ and $n$ nonempty subsets $B_1, B_2, \ldots, B_n$, such…

Group Theory · Mathematics 2018-06-07 M. L. Lewis , D. V. Lytkina , V. D. Mazurov , A. R. Moghaddamfar

Given a finite abelian group $G$ and a subset $S\subseteq G$, we let $N_{G,\ S}$ be the smallest integer $N$ such that for any subset $A\subseteq G$ with $N$ elements, we have $g+S\subseteq A$ for some $g\in G$. Using the probabilistic…

Combinatorics · Mathematics 2025-02-18 Runze Wang

For a finite abelian group $G$ and a splitting field $K$ of $G$, let $d(G, K)$ denote the largest integer $l \in \N$ for which there is a sequence $S = g_1 \cdot ... \cdot g_l$ over $G$ such that $(X^{g_1} - a_1) \cdot ... \cdot (X^{g_l} -…

Combinatorics · Mathematics 2010-12-30 Daniel Smertnig

Given a subset $W$ of an abelian group $G$, a subset $C$ is called an additive complement for $W$ if $W+C=G$; if, moreover, no proper subset of $C$ has this property, then we say that $C$ is a minimal complement for $W$. It is natural to…

Combinatorics · Mathematics 2021-01-01 Noga Alon , Noah Kravitz , Matt Larson

We prove that every partially ordered set on $n$ elements contains $k$ subsets $A_{1},A_{2},\dots,A_{k}$ such that either each of these subsets has size $\Omega(n/k^{5})$ and, for every $i<j$, every element in $A_{i}$ is less than or equal…

Combinatorics · Mathematics 2024-01-02 Jacob Fox , Huy Tuan Pham

Given a set $A=\{a_1,\ldots,a_n\}$ of real numbers and real coefficients $b_1,\ldots,b_n$, consider the distribution of the sum obtained by pairing the $a_i$'s with the $b_i$'s according to a uniformly random permutation. A recent theorem…

Combinatorics · Mathematics 2026-01-12 Zach Hunter , Cosmin Pohoata , Daniel G. Zhu

Suppose that $A$, $B$ and $S$ are non-empty subsets of a finite abelian group $G$. Then the generalized restricted sumset $$ A\stackrel{S}+B:=\{a+b:\,a\in A,\ b\in B,\ a-b\not\in S\} $$ contains at least $$ \min\{|A|+|B|-3|S|,p(G)\} $$…

Number Theory · Mathematics 2016-09-13 Shanshan Du , Hao Pan

We give a notably simpler and shorter proof of H. B. Neumann's result which is stated, cursorly, like this. For any well-ordered subset, A, of a totally ordered semigroup, the set of products of any finite number of elements of A is itself…

Combinatorics · Mathematics 2022-03-03 Labib Haddad

Let $A$ be a nonempty subset of finite abelian group $G$ of order $n$. For an integer $h \geq 2$, the restricted $h$-fold sumset $h^\wedge A$ is the set of all sums of $h$ distinct elements of $A$. It is known that if $G$ is a group of…

Number Theory · Mathematics 2026-05-26 Vivekanand Goswami , Raj Kumar Mistri

For a sequence $S$ of terms from an abelian group $G$ of length $|S|$, let $\Sigma_n(S)$ denote the set of all elements that can be represented as the sum of terms in some $n$-term subsequence of $S$. When the subsum set is very small,…

Number Theory · Mathematics 2019-10-28 David J. Grynkiewicz

Suppose that G is a finite group and A is a subset of G such that 1_A has algebra norm at most M. Then 1_A is a plus/minus sum of at most L cosets of subgroups of G, and L can be taken to be triply tower in O(M). This is a quantitative…

Classical Analysis and ODEs · Mathematics 2012-12-04 Tom Sanders

Hall's theorem on differences of bijections characterizes the multisets $$ \{a_1,\ldots,a_{|G|}\} $$ in a finite abelian group $G$ that can be written in the form $$ a_i=b_i-c_i, $$ where both $b_1,\ldots,b_{|G|}$ and $c_1,\ldots,c_{|G|}$…

Group Theory · Mathematics 2026-05-19 Mohsen Aliabadi

Let $G$ denotes a finite abelian group of order $n$ and Davenport constant $D$, and put $m= n+D-1$. Let $x=(x_1, ..., x_m)\in G^m$ be a sequence with a maximal repetition $\ell$ attained by $x_m$ and put $r=\min(D,\ell)$. Let $w=(w_1, ...,…

Combinatorics · Mathematics 2007-11-27 Yahya O. Hamidoune

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…

Combinatorics · Mathematics 2015-03-19 John T. Griesmer

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…

Number Theory · Mathematics 2017-09-28 David J. Grynkiewicz

Suppose $G$ is a finite abelian group and $S=g_{1}\cdots g_{l}$ is a sequence of elements in $G$. For any element $g$ of $G$ and $A\subseteq\mathbb{Z}\backslash\left\{ 0\right\} $, let $N_{A,g}(S)$ denote the number of subsequences…

Number Theory · Mathematics 2021-02-01 Abílio Lemos , Allan de Oliveira Moura

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…

Number Theory · Mathematics 2020-12-29 Aliaksei Semchankau , Dmitry Shabanov , Ilya Shkredov

Let $A$ and $B$ be finite subsets of $\mathbb{C}$ such that $|B|=C|A|$. We show the following variant of the sum product phenomenon: If $|AB|<\alpha|A|$ and $\alpha \ll \log |A|$, then $|kA+lB|\gg |A|^k|B|^l$. This is an application of a…

Combinatorics · Mathematics 2010-09-14 Karsten Chipeniuk

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…

Combinatorics · Mathematics 2007-05-23 Nets Hawk Katz , Terence Tao