Papers
Topics
Authors
Recent
Search
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.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.