Character-free approach to progression-free sets

DOI10.1016/J.FFA.2011.09.006zbMATH Open1284.11020arXiv0911.0513OpenAlexW2962996730MaRDI QIDQ765807FDOQ765807

Vsevolod F. Lev

Publication date: 22 March 2012

Published in: Finite Fields and their Applications (Search for Journal in Brave)

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).

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

Recommendations

• Progression-free sets
• An improved construction of progression-free sets
• An improved construction of progression-free sets
• A note on maximal progression-free sets
• ON WAYS OF CHARACTERIZING COMPLETE SETS
• A New Approach to Cross-Bifix-Free Sets
• Progress on poset-free families of subsets
• Character sums and generating sets
• On finite pattern-free sets of integers
• Primitive and geometric-progression-free sets without large gaps

zbMATH Keywords

progression-free sets

Mathematics Subject Classification ID

Other combinatorial number theory (11B75) Arithmetic and combinatorial problems involving abstract finite groups (20D60) Arithmetic progressions (11B25)

Cites Work

• On subsets of finite Abelian groups with no 3-term arithmetic progressions

Cited In (3)

• New applications of the polynomial method: The cap set conjecture and beyond
• Progression-free sets in \(\mathbb{Z}_4^n\) are exponentially small
• Additive Combinatorics: With a View Towards Computer Science and Cryptography—An Exposition

This page was built for publication: Character-free approach to progression-free sets

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