The PFR Conjecture Holds for Two Opposing Special Cases

Abstract

Let A ⊂eq F2n be a set with |2A| = K|A|. We prove that if (1) for at least a fraction 1-K-9 of all s ∈ 2A, the set (A+s) A has size at most L·|A|/K, or (2) for at least a fraction K-L of all s ∈ 2A, the set (A+s) A has size at least |A|·(1- K-1/L), then there is a subset B ⊂eq A of size |A|/KOL(1) such that span(B) ≤ KOL(1)·|A|.

0

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.

Discussion (0)

Sign in to join the discussion.

Loading comments…