An example concerning set addition in F₂^n

DOI10.1134/S0081543818080096zbMATH Open1454.11027arXiv1703.01036OpenAlexW2924055027MaRDI QIDQ2423213FDOQ2423213

Authors: Daniel M. Kane, Ben Green 

Publication date: 21 June 2019

Published in: Proceedings of the Steklov Institute of Mathematics (Search for Journal in Brave)

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 $ainA,binB$, but which is extremely far from being "combinatorially" almost closed under addition by $B$: if $A^{\prime }subsetA$, $B^{\prime }subsetB$ and $A^{\prime }+B^{\prime }$ is comparable in size to $A^{\prime }$ then $|B^{\prime }|lessapprox|B{|}^{1/2}$.

Full work available at URL: https://arxiv.org/abs/1703.01036

Recommendations

• On sumsets in \(\mathbb{F}^n_2\)
• A Note on Freĭman's Theorem in Vector Spaces
• Sum-free sets in vector spaces over \(GF(2)\)
• On small sumsets in \((\mathbb{Z}/2\mathbb{Z})^n\)
• On sums of generating sets in \(\mathbb Z_2^n\)

zbMATH Keywords

sumsetadditive combinatorics

Mathematics Subject Classification ID

Arithmetic combinatorics; higher degree uniformity (11B30)

Cites Work

• Additive combinatorics
• Title not available (Why is that?)

Cited In (3)

• Title not available (Why is that?)
• Essential components in vector spaces over finite fields
• Sets of unit vectors with small pairwise sums

This page was built for publication: An example concerning set addition in \(\mathbb{F}_2^n\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2423213)