Lubomíra Dvořáková ; Edita Pelantová ; Jeffrey Shallit - On a sequence of Kimberling and its relationship to the Tribonacci word

dmtcs:16926 - Discrete Mathematics & Theoretical Computer Science, March 23, 2026, vol. 28:2 - https://doi.org/10.46298/dmtcs.16926
On a sequence of Kimberling and its relationship to the Tribonacci wordArticle

Authors: Lubomíra Dvořáková ; Edita Pelantová ; Jeffrey Shallit

    In 2017, Clark Kimberling defined an interesting sequence ${\bf B} = 0100101100 \cdots$ of $0$'s and $1$'s by certain inflation rules, and he made a number of conjectures about this sequence and some related ones. In this note we prove his conjectures using, in part, the Walnut theorem-prover. We show how his word is related to the infinite Tribonacci word, and we determine both the subword complexity and critical exponent of $\bf B$.


    Volume: vol. 28:2
    Section: Combinatorics
    Published on: March 23, 2026
    Accepted on: March 9, 2026
    Submitted on: November 14, 2025
    Keywords: Combinatorics, Formal Languages and Automata Theory