Finding large 3-free sets. I. The small \(n\) case

DOI10.1016/j.jcss.2007.06.002zbMath1144.11010OpenAlexW2100534737MaRDI QIDQ927879

Clyde P. Kruskal, William I. Gasarch, James Glenn

Publication date: 10 June 2008

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcss.2007.06.002

zbMATH Keywords

arithmetic progressionvan der Waerden's theoremarithmetic sequence3-free setsnonaveraging sets

Mathematics Subject Classification ID

Arithmetic progressions (11B25)

Related Items (8)

The equidistant dimension of graphs ⋮ Numerical semigroups of Szemerédi type ⋮ Injective colorings with arithmetic constraints ⋮ Novel structures in Stanley sequences ⋮ On sets without \(k\)-term arithmetic progression ⋮ Unnamed Item ⋮ An improved construction of progression-free sets ⋮ Exploiting word-level parallelism for fast convolutions and their applications in approximate string matching

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Matrix multiplication via arithmetic progressions
• On the diagonal queens domination problem
• Ergodic behavior of diagonal measures and a theorem of Szemeredi on arithmetic progressions
• A new proof of Szemerédi's theorem for arithmetic progressions of length four
• Self-testing/correcting with applications to numerical problems
• Erdős and the integers
• On triples in arithmetic progression
• Gaussian elimination is not optimal
• Integer sets containing no arithmetic progressions
• A PCP characterization of NP with optimal amortized query complexity
• A Nonaveraging Set of Integers With a Large Sum of Reciprocals
• Integer Sets Containing No Arithmetic Progressions
• Probabilistic checking of proofs
• Simple analysis of graph tests for linearity and PCP
• Communication Complexity
• On sets of integers containing no four elements in arithmetic progression
• On k-Free Sequences of Integers
• The Multiparty Communication Complexity of Exact-T: Improved Bounds and New Problems
• On Non-Averaging Sets of Integers
• On Certain Sets of Integers
• On Sets of Integers Which Contain No Three Terms in Arithmetical Progression
• On Sets of Integers Which Contain No Three Terms in Arithmetical Progression
• Unsolved problems in number theory
• A new proof of Szemerédi's theorem

This page was built for publication: Finding large 3-free sets. I. The small \(n\) case