On distinct consecutive $r$-differences
Junxian Li, George Shakan

TL;DR
This paper investigates the properties of sequences with distinct consecutive $r$-differences, establishing sharp bounds on sumsets and extending classical theorems like Steinhaus' three gap theorem, with implications for sequences and return times.
Contribution
It proves a sharp lower bound on the size of sumsets involving sequences with distinct consecutive $r$-differences and generalizes classical results to broader settings.
Findings
Established a sharp inequality for $|A+B|$ involving sequences with distinct $r$-differences.
Generalized Steinhaus' three gap theorem to sequences with arbitrary $r$-differences.
Provided bounds on the size of the set of distinct consecutive $r$-differences for the sequence $ abla n heta$.
Abstract
Suppose of size has distinct consecutive --differences, that is for , the --tuples are distinct. Then for any finite , one has Utilizing de Bruijn sequences, we show this inequality is sharp up to the constant. Moreover, for the sequence , a sharp upper bound for the size of the distinct consecutive --differences is obtained, which generalizes Steinhaus' three gap theorem. A dual problem on the consecutive --differences of the returning times for some defined by is also considered, which generalizes a result of Slater.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicsgraph theory and CDMA systems · Computational Geometry and Mesh Generation · Limits and Structures in Graph Theory
