Personal tools
 

The Polynomial Freiman-Ruzsa Conjecture

— filed under:

Paul Koester, Indiana University

What
  • Analysis Seminar
When Fri, Nov 02, 2007
from 03:30 PM to 04:20 PM
Where RH 119
Add event to calendar vCal
iCal

Freiman's Theorem describes the structure of sets of integers which are almost closed under addition. While his theorem was a major breakthrough, examples show that his description is inefficient. The Polynomial Freiman-Ruzsa Conjecture attempts to fix the inefficiencies in Freiman's Theorem. I will discuss the analogue of the Polynomial Freiman-Ruzsa Conjecture in $\mathbb{F}_{2}^{n}$, the n-dimensional vector space over the field of order 2, along with the best partial result on this conjecture, which heavily uses the $\mathbb{F}_{2}^{n}$ Fourier transform.

« December 2017 »
December
SuMoTuWeThFrSa
12
3456789
10111213141516
17181920212223
24252627282930
31