On distinct consecutive r-differences

Abstract

Suppose A⊂ R of size k has distinct consecutive r--differences, that is for 1 ≤ i ≤ k -r, the r--tuples (ai+1 - ai , … , ai+r - ai + r -1) are distinct. Then for any finite B ⊂ R, one has |A+B| r |A||B|1/(r+1). Utilizing de Bruijn sequences, we show this inequality is sharp up to the constant. Moreover, for the sequence \nα\, a sharp upper bound for the size of the distinct consecutive r--differences is obtained, which generalizes Steinhaus' three gap theorem. A dual problem on the consecutive r--differences of the returning times for some φ ∈ R defined by \T : \Tθ\<φ\ is also considered, which generalizes a result of Slater.

0

Turn this paper into a lesson

ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.

Discussion (0)

Sign in to join the discussion.

Loading comments…