English
Related papers

Related papers: Iterated Sumsets and Setpartitions

200 papers

We determine the structure of a finite subset $A$ of an abelian group given that $|2A|<3(1-\epsilon)|A|$, $\epsilon>0$; namely, we show that $A$ is contained either in a "small" one-dimensional coset progression, or in a union of fewer than…

Number Theory · Mathematics 2020-10-27 Vsevolod F. Lev

Let $(G,+)$ be a countable abelian group such that the subgroup $\{g+g\colon g\in G\}$ has finite index and the doubling map $g\mapsto g+g$ has finite kernel. We establish lower bounds on the upper density of a set $A\subset G$ with respect…

Dynamical Systems · Mathematics 2025-04-14 Dimitrios Charamaras , Ioannis Kousek , Andreas Mountakis , Tristán Radić

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

The classical Cauchy-Davenport theorem implies the lower bound n+1 for the number of distinct subsums that can be formed from a sequence of n elements of the cyclic group Z_p (when p is prime and n<p). We generalize this theorem to a…

Number Theory · Mathematics 2012-09-03 Greg Martin , Alexis Peilloux , Erick B. Wong

A sequence of elements of a finite group G is called a zero-sum sequence if it sums to the identity of G. The study of zero-sum sequences has a long history with many important applications in number theory and group theory. In 1989…

Combinatorics · Mathematics 2007-05-23 Shawn Elldge , Glenn H. Hurlbert

A finite abelian group $G$ of cardinality $n$ is said to be of type III if every prime divisor of $n$ is congruent to 1 modulo 3. We obtain a classification theorem for sum-free subsets of largest possible cardinality in a finite abelian…

Number Theory · Mathematics 2016-06-03 R. Balasubramanian , Gyan Prakash , D. S. Ramana

We prove that any finite abelian group $G$ contains a collection of not too many subsets with a special structure, so that for every subset $A$ of $G$ with a small doubling, there is a member $F$ of the collection that is fully contained in…

Combinatorics · Mathematics 2025-09-03 Noga Alon , Huy Tuan Pham

Let $G$ be a finite abelian group and $S$ a sequence with elements of $G$. Let $|S|$ denote the length of $S$ and $\mathrm{supp}(S)$ the set of all the distinct terms in $S$. For an integer $k$ with $k\in [1, |S|]$, let $\Sigma_{k}(S)…

Combinatorics · Mathematics 2024-04-30 Rui Wang , Han Chao , Jiangtao Peng

Let $\mathcal{G}$ be the greedy algorithm that, for each $\theta\in (0,1]$, produces an infinite sequence of positive integers $(a_n)_{n=1}^\infty$ satisfying $\sum_{n=1}^\infty 1/a_n = \theta$. For natural numbers $p < q$, let…

Number Theory · Mathematics 2024-01-23 Hung Viet Chu

Let p be a prime number. Let G be a finite abelian p-group of exponent n (written additively) and A be a non-empty subset of $]n[:= \{1,2,..., n\}$ such that elements of A are incongruent modulo p and non-zero modulo p. Let $k \geq…

Number Theory · Mathematics 2007-07-16 R Thangadurai

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 G be an additive abelian group whose finite subgroups are all cyclic. Let A_1,...,A_n (n>1) be finite subsets of G with cardinality k>0, and let b_1,...,b_n be pairwise distinct elements of G with odd order. We show that for every…

Combinatorics · Mathematics 2016-09-07 Zhi-Wei Sun

Let $G = C_{n_1} \oplus \cdots \oplus C_{n_r}$ with $1 < n_1 | \cdots | n_r$ be a finite abelian group. The Davenport constant $\mathsf D(G)$ is the smallest integer $t$ such that every sequence $S$ over $G$ of length $|S|\ge t$ has a…

Combinatorics · Mathematics 2021-09-24 Chao Liu

A cornerstone result of Erd\H os, Ginzburg, and Ziv (EGZ) states that any sequence of $2n-1$ elements in $\mathbb{Z}/n$ contains a zero-sum subsequence of length $n$. While algebraic techniques have predominated in deriving many deep…

Godel's First Incompleteness Theorem is generalized to definable theories, which are not necessarily recursively enumerable, by using a couple of syntactic-semantic notions, one is the consistency of a theory with the set of all true…

Logic · Mathematics 2019-07-02 Saeed Salehi , Payam Seraji

Let G be an arbitrary finite group and let S and T be two subsets such that |S|>1, |T|>1, and |TS|< |T|+|S|< |G|-1. We show that if |S|< |G|-4|G|^{1/2}+1 then either S is a geometric progression or there exists a non-trivial subgroup H such…

Combinatorics · Mathematics 2013-10-07 Oriol Serra , Gilles Zémor

Kneser's theorem in the integers asserts that denoting by $ \underline{\mathrm{d}}$ the lower asymptotic density, if $\underline{\mathrm{d}}(X_1+\cdots+X_k)<\sum_{i=1}^k\underline{\mathrm{d}}(X_i)$ then the sumset $X_1+\cdots+X_k$ is…

Number Theory · Mathematics 2025-02-14 Francois Hennecart

Suppose that $k\geq 2$ and $A$ is a non-empty subset of a finite abelian group $G$ with $|G|>1$. Then the cardinality of the restricted sumset $$ k^\wedge A:=\{a_1+\cdots+a_k:\,a_1,\ldots,a_k\in A,\ a_i\neq a_j\text{ for }i\neq j\} $$ is at…

Combinatorics · Mathematics 2024-03-07 Shanshan Du , Hao Pan

Let A,B,S be finite subsets of an abelian group G. Suppose that the restricted sumset C={a+b: a in A, b in B, and a-b not in S} is nonempty and some c in C can be written as a+b with a in A and b in B in at most m ways. We show that if G is…

Combinatorics · Mathematics 2007-05-23 Hao Pan , Zhi-Wei Sun

We announce two breakthrough results concerning important questions in the Theory of Computational Complexity. In this expository paper, a systematic and comprehensive geometric characterization of the Subset Sum Problem is presented. We…

Computational Complexity · Computer Science 2025-11-21 Srinivas Balaji Bollepalli