Abstract
Let G be a finite abelian group of order n, and for each a∈G and integer 1≤h≤n let Fa(h) denote the family of all h-element subsets of G whose sum is a. A problem posed by Katona and Makar-Limanov is to determine whether the minimum and maximum sizes of the families Fa(h) (as a ranges over G) become asymptotically equal as n→∞ when [Formula presented]. We affirmatively answer this question and in fact show that the same asymptotic equality holds for every [Formula presented].
| Original language | English |
|---|---|
| Article number | 104239 |
| Journal | European Journal of Combinatorics |
| Volume | 131 |
| DOIs | |
| State | Published - Jan 2026 |
Keywords
- Extremal combinatorics
- Finite abelian group
- Subset sums
Fingerprint
Dive into the research topics of 'The asymptotic uniform distribution of subset sums'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver