English

A polynomial Freiman-Ruzsa inverse theorem for function fields

Number Theory 2025-10-09 v2

Abstract

Using the recent proof of the polynomial Freiman-Ruzsa conjecture over Fpn\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 AFp[t]A\subset\mathbb{F}_p[t] satisfies A+tAKA\lvert A+tA\rvert\leq K\lvert A\rvert then AA is efficiently covered by at most KO(1)K^{O(1)} translates of a generalised arithmetic progression of rank O(logK)O(\log K) and size at most KO(1)AK^{O(1)}\lvert A\rvert. As an application we give an optimal lower bound for the size of A+ξAA+\xi A where AFp((1/t))A\subset\mathbb{F}_p((1/t)) is a finite set and ξFp((1/t))\xi\in \mathbb{F}_p((1/t)) is transcendental over Fp[t]\mathbb{F}_p[t].

Keywords

Cite

@article{arxiv.2501.11580,
  title  = {A polynomial Freiman-Ruzsa inverse theorem for function fields},
  author = {Thomas F. Bloom},
  journal= {arXiv preprint arXiv:2501.11580},
  year   = {2025}
}

Comments

11 pages

R2 v1 2026-06-28T21:11:29.588Z