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

DOI10.1016/J.JCTA.2020.105393zbMATH Open1461.11028arXiv1903.09352OpenAlexW3118470218MaRDI QIDQ2229162FDOQ2229162

Brandon Hanson

Publication date: 22 February 2021

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

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.

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)

Cites Work

• On Sumsets of Convex Sets
• On sets of integers containing k elements in arithmetic progression
• Title not available (Why is that?)
• Integer Sum Sets Containing Long Arithmetic Progressions
• Arithmetic progressions in sumsets
• A probabilistic technique for finding almost-periods of convolutions
• Title not available (Why is that?)
• Arithmetic patches, weak tangents, and dimension
• Arithmetic Progressions in Sumsets and L^p-Almost-Periodicity
• Higher convexity and iterated sum sets
• Convex sequences may have thin additive bases

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)