A variant of Tao's method with application to restricted sumsets
Song Guo, Zhi-Wei Sun

TL;DR
This paper extends Tao's harmonic analysis approach to restricted sumsets in prime cyclic groups, providing a new proof for a generalized Erdős–Heilbronn type inequality with applications to additive combinatorics.
Contribution
It introduces a modified version of Tao's method to prove a new lower bound for restricted sumsets involving a subset S in prime cyclic groups.
Findings
Established a lower bound for restricted sumsets in Z/pZ involving a subset S.
Extended Tao's harmonic analysis technique to handle restrictions in sumset problems.
Provided a new proof for a generalized Erdős–Heilbronn conjecture.
Abstract
In this paper, we develop Terence Tao's harmonic analysis method and apply it to restricted sumsets. The well known Cauchy-Davenport theorem asserts that if and are nonempty subsets of with a prime, then , where . In 2005, Terence Tao gave a harmonic analysis proof of the Cauchy-Davenport theorem, by applying a new form of the uncertainty principle on Fourier transform. We modify Tao's method so that it can be used to prove the following extension of the Erdos-Heilbronn conjecture: If are nonempty subsets of with a prime, then .
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
TopicsGraph Labeling and Dimension Problems · Graph theory and applications · Limits and Structures in Graph Theory
