Relative sizes of iterated sumsets (Q7019151)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 7995929
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Relative sizes of iterated sumsets |
scientific article; zbMATH DE number 7995929 |
Statements
Relative sizes of iterated sumsets (English)
0 references
5 March 2025
0 references
Let \(G\) be an abelian group and \(A_1,\dots, A_n\) be some finite subsets of \(G\). Take a positive integer \(h\) and form the following tuple \((|hA_1|, \dots, |hA_n|)\), where \(hA:= \{ a_1+\dots+a_h : a_j\in A\}\) is the \(h\)-sumset of \(A\). Suppose that all numbers \(|hA_1|, \dots, |hA_n|\) are distinct. Also, let \(\sigma \in S_n\) be a permutation on \(\{1,\dots,n\}\). We say that \(\sigma\) and \((|hA_1|, \dots, |hA_n|)\) have the same relative order if \(\sigma(i) < \sigma(j)\) iff \(|hA_i| < |hA_j|\) for all \(i,j\in \{1,\dots, n\}\). Answering a question of M. Nathanson the author proves, in particular,\N\NTheorem. Let \(n,H\) be positive integers. Then for every sufficiently large abelian group \(G\) and any permutations \(\sigma_1,\dots,\sigma_H \in S_n\), there are finite sets \(A_1,\dots, A_n \subseteq G\) such that \((|hA_1|, \dots, |hA_n|)\) has the same relative order as \(\sigma_h\), where \(h=1,\dots, H\).
0 references
iterated sumsets
0 references
inverse problems in additive combinatorics
0 references