Nearly-polynomial inverse theorem for the U^d norm in degree d+1
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866910181106909184 |
|---|---|
| author | Milo, Tomer Moshkovitz, Guy |
| author_facet | Milo, Tomer Moshkovitz, Guy |
| contents | We prove a nearly polynomial inverse theorem for the Gowers $U^d$ norm, over finite fields of non-small characteristic, for polynomials of degree $d+1$. The case of degree $d$ was very recently settled by Milićević and Randelović with a fully polynomial bound. We moreover provide a nearly polynomial inverse theorem for homogeneous polynomials of any degree smaller than $2d$.
Our methods may be of independent interest, and include a refined notion of polynomial decomposition that captures correlation with polynomials of lower degree than classical notions do, and a new correlation lemma that improves upon similar lemmas in the literature. Additionally, we illustrate the usefulness of the new correlation lemma by using it to give an alternative proof for the aforementioned result of Milićević and Randelović. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2603_16836 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Nearly-polynomial inverse theorem for the U^d norm in degree d+1 Milo, Tomer Moshkovitz, Guy Combinatorics Discrete Mathematics 11B30 (Primary) 11T06, 15A69 (Secondary) We prove a nearly polynomial inverse theorem for the Gowers $U^d$ norm, over finite fields of non-small characteristic, for polynomials of degree $d+1$. The case of degree $d$ was very recently settled by Milićević and Randelović with a fully polynomial bound. We moreover provide a nearly polynomial inverse theorem for homogeneous polynomials of any degree smaller than $2d$. Our methods may be of independent interest, and include a refined notion of polynomial decomposition that captures correlation with polynomials of lower degree than classical notions do, and a new correlation lemma that improves upon similar lemmas in the literature. Additionally, we illustrate the usefulness of the new correlation lemma by using it to give an alternative proof for the aforementioned result of Milićević and Randelović. |
| title | Nearly-polynomial inverse theorem for the U^d norm in degree d+1 |
| topic | Combinatorics Discrete Mathematics 11B30 (Primary) 11T06, 15A69 (Secondary) |
| url | https://arxiv.org/abs/2603.16836 |