Critical Numbers for Restricted Sumsets: Rigidity and Collapse in Finite Abelian Groups
Bocong Chen, Jing Huang

TL;DR
This paper classifies critical numbers for restricted sumsets in finite abelian groups, revealing a structural dichotomy based on parity that impacts the density thresholds for additive properties, with applications to algebraic coding theory.
Contribution
It provides a complete classification of critical numbers for restricted sumsets in finite abelian groups, establishing a parity-based structural dichotomy and resolving a conjecture in coding theory.
Findings
For even-order groups, the critical number is fixed at |G|/2+1.
For odd-order groups, the critical threshold is lower and bounded by prime divisors.
The results generalize previous work on cyclic groups and have applications in elliptic curve coding.
Abstract
This paper establishes a classification of the critical numbers for restricted sumsets in finite abelian groups, determining them exactly for even-order groups and bounding them for odd-order groups, while revealing a fundamental structural dichotomy governed by parity. For groups of even order, we prove a universal rigidity theorem: the index- subgroup creates an immutable arithmetic barrier at density , fixing the critical number at regardless of the group's internal structure. In sharp contrast, we demonstrate that for groups of odd order, this barrier vanishes, causing the critical threshold to collapse to significantly lower densities bounded by index- obstructions or the smallest prime divisor. These results unify and vastly generalize previous work on cyclic groups, providing a definitive structural theory for the transition from sparsity to saturation. As a…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsLimits and Structures in Graph Theory · Coding theory and cryptography · Finite Group Theory Research
