Long regularly-spaced and convex sequences in dense sets of integers

DOI10.1016/J.JCTA.2020.105393MaRDI QIDQ2229162zbMATH OpenOpenAlexFDO

Authors Brandon Hanson

Publication date 22 February 2021

Published in Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

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

zbMATH Keywords

Ramsey theoryarithmetic progressionadditive combinatoricsconvex sequence

Mathematics Subject Classification ID

Ramsey theory (05D10) Arithmetic progressions (11B25) Arithmetic combinatorics; higher degree uniformity (11B30)

Abstract: Let A be a set of integers dense in a finite interval. We establish upper and lower bounds for the longest regularly-spaced and convex subsets of A and of A-A.

Recommendations

• scientific article; zbMATH DE number 5181747
• Long arithmetic progressions in sumsets: Thresholds and bounds
• Long arithmetic progressions in sum-sets and the number x-sum-free sets
• Integer Sum Sets Containing Long Arithmetic Progressions
• Arithmetic progressions in subset sums

Cites work

• scientific article; zbMATH DE number 4177149 (Why is no real title available?)
• scientific article; zbMATH DE number 5181747 (Why is no real title available?)
• A probabilistic technique for finding almost-periods of convolutions
• Arithmetic patches, weak tangents, and dimension
• Arithmetic progressions in sumsets
• Arithmetic progressions in sumsets and \(L^p\)-almost-periodicity
• Convex sequences may have thin additive bases
• Higher convexity and iterated sum sets
• Integer Sum Sets Containing Long Arithmetic Progressions
• On sets of integers containing k elements in arithmetic progression
• On sumsets on convex sets

This page was built for publication: Long regularly-spaced and convex sequences in dense sets of integers

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