Translation invariance in groups of prime order
Vsevolod F. Lev

TL;DR
This paper proves a bound on the number of shifts of a subset in a prime order group that minimally expand the set, extending previous integer results to prime groups with optimal bounds.
Contribution
It extends known results about translation invariance and minimal expansion from integers to groups of prime order, establishing optimal bounds and discussing potential relaxations.
Findings
Bound on the number of non-zero elements with small set difference after translation.
The bound is optimal up to a constant factor.
The result generalizes earlier integer-based theorems to prime order groups.
Abstract
We prove that there is an absolute constant with the following property: if denotes the group of prime order , and a subset satisfies , then for any positive integer there are at most non-zero elements with . This (partially) extends onto prime-order groups the result, established earlier by S. Konyagin and the present author for the group of integers. We notice that if is an arithmetic progression and , then there are exactly non-zero elements with . Furthermore, the bound is best possible up to the value of the constant . On the other hand, it is likely that the assumption can be dropped or substantially relaxed.
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
TopicsFinite Group Theory Research · graph theory and CDMA systems · Limits and Structures in Graph Theory
