2000 character limit reached
Symmetric Kneser's Theorem with Trios and $3$-Transform
Published 8 Feb 2016 in math.NT and math.GR | (1602.02484v1)
Abstract: We give a new equivalent restatement and a new proof in terms of trios to the classical Kneser's theorem. In the finite case, our restatement takes the following, particularly symmetric shape: if $A$, $B$, and $C$ are subsets of a finite abelian group $G$ such that $A+B+C\ne G$, then, denoting by $H$ the period of the sumset $A+B+C$, we have $$ |A|+|B|+|C| \le |G|+|H|. $$ The proof is based on an extension of the familiar Dyson transform onto set systems containing three (or more) sets.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.