arXiv Analytics

Sign in

arXiv:2408.13755 [math.CO]AbstractReferencesReviewsResources

On the Elementary Proof of the Inverse Erdős-Heilbronn Problem

Shengning Zhang

Published 2024-08-25Version 1

In this article, we studied the inverse Erd\H{o}s-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 $\mathbb{Z}$ and some partial results that contributes to the elementary proof of the problem in $\mathbb{Z}/p\mathbb{Z}$, avoiding the usage of the powerful polynomial method and the Combinatorial Nullstellensatz.

Related articles: Most relevant | Search more
arXiv:math/9808107 [math.CO] (Published 1998-08-25, updated 1998-08-28)
Elementary proofs of identities for Schur functions and plane partitions
arXiv:1302.4647 [math.CO] (Published 2013-02-19)
A generalization of Combinatorial Nullstellensatz
arXiv:2003.01112 [math.CO] (Published 2020-03-02)
Combinatorial Nullstellensatz and DP-coloring of Graphs