On the Elementary Proof of the Inverse Erdos-Heilbronn Problem
Abstract
In this article, we studied the inverse Erdos-Heilbronn problem with the restricted sumset from two components A and B that are not necessarily the same. We give a completely elementary proof for the problem in Z and some partial results that contributes to the elementary proof of the problem in Z/pZ, avoiding the usage of the powerful polynomial method and the Combinatorial Nullstellensatz.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.