# An example concerning set addition in F_2^n

## TL;DR

The paper constructs specific sets in a vector space over F_2 demonstrating a discrepancy between statistical and combinatorial notions of closure under addition, revealing nuanced structural properties.

## Contribution

It introduces sets that are statistically almost closed under addition but far from combinatorially almost closed, highlighting differences in additive combinatorics.

## Key findings

- Sets are statistically almost closed under addition.
- Sets are not combinatorially almost closed unless subsets are very small.
- Demonstrates a significant gap between statistical and combinatorial closure properties.

## Abstract

We construct sets $A, B$ in a vector space over $\mathbb{F}_2$ with the property that $A$ is "statistically" almost closed under addition by $B$ in the sense that $a + b$ almost always lies in $A$ when $a \in A, b \in B$, but which is extremely far from being "combinatorially" almost closed under addition by $B$: if $A' \subset A$, $B' \subset B$ and $A' + B'$ is comparable in size to $A'$ then $|B'| \lessapprox |B|^{1/2}$.