Declaration search

Search projects and Mathlib in one place.

Find source-pinned declarations outside Mathlib by name or constant. The same query runs through Loogle for genuine elaborated structural search over Mathlib.

Standalone research projects

9 source-pinned matches

Therefore index
PFR_conjecture

Polynomial Freiman-Ruzsa project · PFR.Main

Open proof record

Plain-language statement

The polynomial Freiman-Ruzsa (PFR) conjecture: if A is a subset of an elementary abelian 2-group of doubling constant at most K, then A can be covered by at most 2 * K ^ 12 cosets of a subgroup of cardinality at most |A|.

PFR_conjecture_improv

Polynomial Freiman-Ruzsa project · PFR.ImprovedPFR

Open proof record

Project documentation

Improved polynomial Freiman-Ruzsa theorem. Let AA be a nonempty subset of a finite elementary abelian 22-group. If A+AKA|A+A|\le K|A|, then there are a subspace HH and a set of representatives cc such that Ac+HA\subseteq c+H, c<2K11|c|<2K^{11}, and HA|H|\le|A|.

PFR_conjecture_improv'

Polynomial Freiman-Ruzsa project · PFR.ImprovedPFR

Open proof record

Project documentation

Improved polynomial Freiman-Ruzsa theorem without a finite ambient-group assumption. Let AA be a nonempty finite subset of an elementary abelian 22-group. If A+AKA|A+A|\le K|A|, then there are a finite subspace HH and a finite set cc such that Ac+HA\subseteq c+H, c<2K11|c|<2K^{11}, and HA|H|\le|A|.

PFR_conjecture'

Polynomial Freiman-Ruzsa project · PFR.Main

Open proof record

Project documentation

Polynomial Freiman-Ruzsa theorem without a finite ambient-group assumption. Let AA be a nonempty finite subset of an elementary abelian 22-group. If A+AKA|A+A|\le K|A|, then there are a finite subspace HH and a finite set cc such that Ac+HA\subseteq c+H, c<2K12|c|<2K^{12}, and HA|H|\le|A|.

better_PFR_conjecture

Polynomial Freiman-Ruzsa project · PFR.RhoFunctional

Open proof record

Plain-language statement

If AF2nA \subset {\bf F}_2^n is finite non-empty with A+AKA|A+A| \leq K|A|, then there exists a subgroup HH of F2n{\bf F}_2^n with HA|H| \leq |A| such that AA can be covered by at most 2K92K^9 translates of HH.

Mathlib

0 elaborated matches

Open in Loogle
Loogle returned no Mathlib declaration for this query.
name contains “PFR_conjecture”