A polynomial Freiman-Ruzsa inverse theorem for function fields
Abstract
Using the recent proof of the polynomial Freiman-Ruzsa conjecture over Fpn 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⊂Fp[t] satisfies A+tA≤ K A then A is efficiently covered by at most KO(1) translates of a generalised arithmetic progression of rank O( K) and size at most KO(1) A. As an application we give an optimal lower bound for the size of A+ A where A⊂Fp((1/t)) is a finite set and ∈ Fp((1/t)) is transcendental over Fp[t].
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.