On the Elementary Proof of the Inverse Erdős-Heilbronn Problem
Fuente:
arXiv
Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2024
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866929473017872384 |
|---|---|
| author | Zhang, Shengning |
| author_facet | Zhang, Shengning |
| contents | In this article, we studied the inverse Erdő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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2408_13755 |
| institution | arXiv |
| publishDate | 2024 |
| record_format | arxiv |
| spellingShingle | On the Elementary Proof of the Inverse Erdős-Heilbronn Problem Zhang, Shengning Combinatorics In this article, we studied the inverse Erdő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. |
| title | On the Elementary Proof of the Inverse Erdős-Heilbronn Problem |
| topic | Combinatorics |
| url | https://arxiv.org/abs/2408.13755 |