Skip to content

Commit 7ee82a5

Browse files
committed
Fix the website landing page
1 parent 4d9ac12 commit 7ee82a5

File tree

1 file changed

+1
-1
lines changed

1 file changed

+1
-1
lines changed

website/index.md

+1-1
Original file line numberDiff line numberDiff line change
@@ -10,7 +10,7 @@ usemathjax: true
1010

1111
# The Polynomial Freiman-Ruzsa Conjecture
1212

13-
The original purpose of this repository is to hold a Lean4 formalization of [the proof of the Polynomial Freiman-Ruzsa (PFR) conjecture](https://arxiv.org/abs/2311.05762) of Katalin Marton (see also [this blog post](https://terrytao.wordpress.com/2023/11/13/on-a-conjecture-of-marton)). The statement is as follows: if $A$ is a non-empty subset of ${\bf F}_2^n$ such that $|A+A| \leq K|A|$, then $A$ can be covered by at most $2K^{12}$ cosets of a subspace $H$ of ${\bf F}_2^n$ of cardinality at most $|A|$. The proof relies on the theory of Shannon entropy, so in particular development of the Shannon entropy inequalities was needed.
13+
The original purpose of this repository is to hold a Lean4 formalization of [the proof of the Polynomial Freiman-Ruzsa (PFR) conjecture](https://arxiv.org/abs/2311.05762) of Katalin Marton (see also [this blog post](https://terrytao.wordpress.com/2023/11/13/on-a-conjecture-of-marton)). The statement is as follows: if $A$ is a non-empty subset of ${\bf F}_2^n$ such that $\vert A+A\vert \leq K\vert A\vert$, then $A$ can be covered by at most $2K^{12}$ cosets of a subspace $H$ of ${\bf F}_2^n$ of cardinality at most $\vert A\vert$. The proof relies on the theory of Shannon entropy, so in particular development of the Shannon entropy inequalities was needed.
1414

1515
After the primary purpose of the project was completed, a second stage of the project developed several consequences of PFR, as well as an argument of Jyun-Jie Liao that reduced the exponent $12$ to $11$. This second stage has also been completed.
1616

0 commit comments

Comments
 (0)