An improved lower bound related to the Furstenberg-Sárközy theorem
zbMATH Open1307.05219MaRDI QIDQ2256129FDOQ2256129
Authors: 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
File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)
Recommendations
Combinatorial aspects of difference sets (number-theoretic, group-theoretic, etc.) (05B10) Ramsey theory (05D10)
Cites Work
- An improved branch and bound algorithm for the maximum clique problem
- Ergodic behavior of diagonal measures and a theorem of Szemeredi on arithmetic progressions
- An improved construction of progression-free sets
- On difference sets of sequences of integers. I
- On Sets of Natural Numbers Whose Difference Set Contains No Squares
- Difference sets without squares
- On Sets of Integers Which Contain No Three Terms in Arithmetical Progression
- A quantitative improvement for Roth's theorem on arithmetic progressions: Table 1.
- On Roth's theorem on progressions
- A note on Elkin's improvement of Behrend's construction
- On Quadratic Residues and Nonresidues in Difference Sets Modulo m
- On difference sets of sequences of integers. III
- Title not available (Why is that?)
- A new proof of Sárközy's theorem
- On Maximal Residue Difference Sets Modulo p
Cited In (16)
- The Lower Bound for Koldobsky’s Slicing Inequality via Random Rounding
- Asymptotic improvements to the lower bound of certain bipartite Turán numbers
- Near optimal bounds in Freiman's theorem
- Multivariate Polynomial Values in Difference Sets
- An Improved Bound for an Extension of Fine and Wilf’s Theorem and Its Optimality
- Faster Evaluation of Subtraction Games
- An improved bound for the Manickam-Miklós-Singhi conjecture
- An improved probability bound for the approximate S-lemma
- A strong-type Furstenberg-Sárközy theorem for sets of positive measure
- Automata, Languages and Programming
- Title not available (Why is that?)
- A new upper bound for sets with no square differences
- New lower bounds for the Hadwiger numbers of \(\ell_p\) balls for \(p<2\)
- Sets whose differences avoid squares modulo 𝑚
- Title not available (Why is that?)
- A maximal extension of the best-known bounds for the Furstenberg–Sárközy theorem
Uses Software
This page was built for publication: An improved lower bound related to the Furstenberg-Sárközy theorem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2256129)
