Character-free approach to progression-free sets
Number Theory
2009-11-04 v1 Combinatorics
Abstract
We present an elementary combinatorial argument showing that the density of a progression-free set in a finite r-dimensional vector space is O(1/r).
Cite
@article{arxiv.0911.0513,
title = {Character-free approach to progression-free sets},
author = {Vsevolod F. Lev},
journal= {arXiv preprint arXiv:0911.0513},
year = {2009}
}