Abstract
Let A be a set of integers which is dense in a finite interval. We establish upper and lower bounds for the longest regularly-spaced and convex sequences in A and in A−A.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
