Base 3/2 and Greedily Partitioned Sequences

arXiv2007.09705MaRDI QIDQ6345398FDOQ6345398

Authors: Tanya Khovanova, Kevin Wu 

Publication date: 19 July 2020

Abstract: We delve into the connection between base $frac32$ and the greedy partition of non-negative integers into 3-free sequences. Specifically, we find a fractal structure on strings written with digits 0, 1, and 2. We use this structure to prove that the even non-negative integers written in base $frac32$ and then interpreted in base 3 form the Stanley cross-sequence, where the Stanley cross-sequence comprises the first terms of the infinitely many sequences that are formed by the greedy partition of non-negative integers into 3-free sequences.

Mathematics Subject Classification ID

Arithmetic progressions (11B25)

This page was built for publication: Base 3/2 and Greedily Partitioned Sequences

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