A generalization of Croot-Lev-Pach's Lemma and a new upper bound for the size of difference sets in polynomial rings
Fuente:
arXiv
Saved in:
| Main Author: | |
|---|---|
| Format: | Preprint |
| Published: |
2018
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866916255468879872 |
|---|---|
| author | Hegedüs, Gábor |
| author_facet | Hegedüs, Gábor |
| contents | Croot, Lev and Pach used a new polynomial technique to give a new exponential upper bound for the size of three-term progression-free subsets in the groups $(\mathbb Z _4)^n$.
The main tool in proving their striking result is a simple lemma about polynomials, which gives interesting new bounds for the size of subsets of the vector space $({\mathbb Z _p})^n$.
Our main result is a generalization of this lemma. In the proof we combined Tao's slice rank bounding method with Gröbner basis technique.
As an application, we improve Green's results and present new upper bounds for the size of difference sets in polynomial rings. We give a new, more concrete upper bound for the size of arithmetic progression-free subsets in $({\mathbb Z _p})^n$. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_1803_05308 |
| institution | arXiv |
| publishDate | 2018 |
| record_format | arxiv |
| spellingShingle | A generalization of Croot-Lev-Pach's Lemma and a new upper bound for the size of difference sets in polynomial rings Hegedüs, Gábor Combinatorics Number Theory 05B10, 13P10, 15A69 Croot, Lev and Pach used a new polynomial technique to give a new exponential upper bound for the size of three-term progression-free subsets in the groups $(\mathbb Z _4)^n$. The main tool in proving their striking result is a simple lemma about polynomials, which gives interesting new bounds for the size of subsets of the vector space $({\mathbb Z _p})^n$. Our main result is a generalization of this lemma. In the proof we combined Tao's slice rank bounding method with Gröbner basis technique. As an application, we improve Green's results and present new upper bounds for the size of difference sets in polynomial rings. We give a new, more concrete upper bound for the size of arithmetic progression-free subsets in $({\mathbb Z _p})^n$. |
| title | A generalization of Croot-Lev-Pach's Lemma and a new upper bound for the size of difference sets in polynomial rings |
| topic | Combinatorics Number Theory 05B10, 13P10, 15A69 |
| url | https://arxiv.org/abs/1803.05308 |