An improved lower bound related to the Furstenberg-Sárközy theorem

zbMath1307.05219MaRDI QIDQ2256129

Mark Lewko

Publication date: 19 February 2015

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: http://www.combinatorics.org/ojs/index.php/eljc/article/view/v22i1p32

zbMATH Keywords

Ramsey theorysquaresdifference set

Mathematics Subject Classification ID

Combinatorial aspects of difference sets (number-theoretic, group-theoretic, etc.) (05B10) Ramsey theory (05D10)

Related Items (5)

A new upper bound for sets with no square differences ⋮ Multivariate Polynomial Values in Difference Sets ⋮ A maximal extension of the best-known bounds for the Furstenberg–Sárközy theorem ⋮ Sets whose differences avoid squares modulo 𝑚 ⋮ Faster Evaluation of Subtraction Games

Uses Software

• MaxCliqueDyn

Cites Work

• Unnamed Item
• Unnamed Item
• On Roth's theorem on progressions
• Difference sets without squares
• Ergodic behavior of diagonal measures and a theorem of Szemeredi on arithmetic progressions
• An improved construction of progression-free sets
• A new proof of Sárközy’s theorem
• A Note on Elkin’s Improvement of Behrend’s Construction
• A quantitative improvement for Roth's theorem on arithmetic progressions: Table 1.
• On Sets of Natural Numbers Whose Difference Set Contains No Squares
• On difference sets of sequences of integers. I
• On difference sets of sequences of integers. III
• On Maximal Residue Difference Sets Modulo p
• On Quadratic Residues and Nonresidues in Difference Sets Modulo m
• On Sets of Integers Which Contain No Three Terms in Arithmetical Progression

This page was built for publication: An improved lower bound related to the Furstenberg-Sárközy theorem