https://discreteanalysisjournal.com/article/145176-a-polynomial-freiman-ruzsa-inverse-theorem-for-function-fields
Discrete Analysis · 2025
DOI: 10.19086/da.145176 ↗At a glance
Journal article in Discrete Analysis, 2025.
Abstract (original language)
Using the recent proof of the polynomial Freiman-Ruzsa conjecture over $\mathbb{F}_p^n$ by Gowers, Green, Manners, and Tao, we prove a version of the polynomial Freiman-Ruzsa conjecture over function fields. In particular, we prove that if $A\subset\mathbb{F}_p[t]$ satisfies $\lvert A+tA\rvert\leq K\lvert A\rvert$ then $A$ is efficiently covered by at most $K^{O(1)}$ translates of a generalised arithmetic progression of rank $O(\log K)$ and size at most $K^{O(1)}\lvert A\rvert$. As an application we give an optimal lower bound for the size of $A+\xi A$ where $A\subset\mathbb{F}_p((1/t))$ is a finite set and $\xi\in \mathbb{F}_p((1/t))$ is transcendental over $\mathbb{F}_p[t]$.
Cite
APA
(2025). https://discreteanalysisjournal.com/article/145176-a-polynomial-freiman-ruzsa-inverse-theorem-for-function-fields. Discrete Analysis. https://doi.org/10.19086/da.145176
Vancouver
https://discreteanalysisjournal.com/article/145176-a-polynomial-freiman-ruzsa-inverse-theorem-for-function-fields. Discrete Analysis. 2025. doi:10.19086/da.145176
BibTeX
@article{euvimed2025,
title = {https://discreteanalysisjournal.com/article/145176-a-polynomial-freiman-ruzsa-inverse-theorem-for-function-fields},
journal = {Discrete Analysis},
year = {2025},
doi = {10.19086/da.145176}
}
EUVIMED