English
Related papers

Related papers: Iterated Sumsets and Subsequence Sums

200 papers

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

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

Let $G$ be a finite abelian group and $s$ be a positive integer. A subset $A$ of $G$ is called a {\em perfect $s$-basis of $G$} if each element of $G$ can be written uniquely as the sum of at most $s$ (not-necessarily-distinct) elements of…

Number Theory · Mathematics 2022-11-28 Bela Bajnok , Connor Berson , Hoang Anh Just

For a sequence $S$ over a finite abelian group, let $MZ(S)$ denote the length of the shortest nonempty zero-sum subsequence of $S$. We prove that if $G$ is finite abelian of order $n$ and $S$ has length $n$, then $MZ(S)\le n-|\supp(S)|+1$.…

Number Theory · Mathematics 2026-05-29 Claudiu Pop , George C. Ţurcaş

The first part of the paper is a brief overview of Hindman's finite sums theorem, its prehistory and a few of its further generalizations, and a modern technique used in proving these and similar results, which is based on idempotent…

General Topology · Mathematics 2024-12-30 Denis I. Saveliev

Given a set $A \subseteq \mathbb{F}_p^n$, what conditions does one need to guarantee that iterated sumsets of the form $A+\cdots+A$ expand quickly (say, within $O(p)$ terms) to the whole space? When only the size of $A$ is known, such…

Combinatorics · Mathematics 2025-10-13 Manik Dhar , Sammy Luo

For a set $A$ of $k$ elements from an additive abelian group $G$ and a positive integer $r \leq k$, we consider the set of elements of $G$ that can be written as a sum of $h$ elements of $A$ with at least $r$ distinct elements. We denote…

Combinatorics · Mathematics 2025-01-13 Jagannath Bhanja

We prove that outer commutator words are uniformly concise, i.e. if an outer commutator word w takes m different values in a group G, then the order of the verbal subgroup w(G) is bounded by a function depending only on m and not on w or G.…

Group Theory · Mathematics 2014-02-26 Gustavo A. Fernández-Alcober , Marta Morigi

Let K \subset L be a field extension. Given K-subspaces A,B of L, we study the subspace spanned by the product set AB = {ab | a \in A, b \in B}. We obtain some lower bounds on the dimension of this subspace and on dim B^n in terms of dim A,…

Combinatorics · Mathematics 2021-08-19 Shalom Eliahou , Cédric Lecouvey

We prove that if $d \ge 2$ is an integer, $G$ is a finite abelian group, $Z_0$ is a subset of $G$ not contained in any strict coset in $G$, and $E_1,\dots,E_d$ are dense subsets of $G^n$ such that the sumset $E_1+\dots+E_d$ avoids $Z_0^n$…

Combinatorics · Mathematics 2024-11-22 Thomas Karam , Peter Keevash

Let $G=C_n\oplus C_n$ and let $k\in [0,n-1]$. We study the structure of sequences of terms from $G$ with maximal length $|S|=2n-2+k$ that fail to contain a nontrivial zero-sum subsequence of length at most $2n-1-k$. For $k\leq 1$, this is…

Number Theory · Mathematics 2021-09-22 David J. Grynkiewicz , Chao Liu

By a [$K$-]approximate subring of a ring we mean an additively symmetric subset $X$ such that $X \cdot X \cup (X + X)$ is covered by finitely many [resp.\ $K$] additive translates of $X$. We prove a structure theorem for finite approximate…

Rings and Algebras · Mathematics 2026-04-07 Krzysztof Krupiński , Simon Machado

Let $G$ be an abelian group of finite order $n$, and let $h$ be a positive integer. A subset $A$ of $G$ is called {\em weakly $h$-incomplete}, if not every element of $G$ can be written as the sum of $h$ distinct elements of $A$; in…

Number Theory · Mathematics 2016-07-20 Béla Bajnok , Samuel Edwards

We study dimensions of sumsets and iterated sumsets and provide natural conditions which guarantee that a set $F \subseteq \mathbb{R}$ satisfies $\overline{\dim}_\text{B} F+F > \overline{\dim}_\text{B} F$ or even $\dim_\text{H} n F \to 1$.…

Metric Geometry · Mathematics 2021-03-26 Jonathan M. Fraser , Douglas C. Howroyd , Han Yu

We investigate additive properties of sets $A,$ where $A=\{a_1,a_2,\ldots ,a_k\}$ is a monotone increasing set of real numbers, and the differences of consecutive elements are all distinct. It is known that $|A+B|\geq c|A||B|^{1/2}$ for any…

Combinatorics · Mathematics 2021-07-01 Imre Ruzsa , Jozsef Solymosi

We provide optimal upper bounds on the growth of iterated sumsets $hA=A+\dots+A$ for finite subsets $A$ of abelian semigroups. More precisely, we show that the new upper bounds recently derived from Macaulay's theorem in commutative algebra…

Commutative Algebra · Mathematics 2023-10-17 Shalom Eliahou , Eshita Mazumdar

Szemeredi's regularity lemma is an important tool in graph theory which has applications throughout combinatorics. In this paper we prove an analogue of Szemeredi's regularity lemma in the context of abelian groups and use it to derive some…

Combinatorics · Mathematics 2007-05-23 Ben Green

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(…

Combinatorics · Mathematics 2018-07-03 Terence Tao

For a finite multiset $A$ of an abelian group $G$, let $\text{FS}(A)$ denote the multiset of the $2^{|A|}$ subset sums of $A$. It is natural to ask to what extent $A$ can be reconstructed from $\text{FS}(A)$. We fully solve this problem for…

Combinatorics · Mathematics 2024-12-10 Federico Glaudo , Noah Kravitz

In this note, we give the explicit formula for the number of multisubsets of a finite abelian group $G$ with any given size such that the sum is equal to a given element $g\in G$. This also gives the number of partitions of $g$ into a given…

Combinatorics · Mathematics 2013-05-15 Amela Muratovic-Ribic , Qiang Wang