Skip to main contentSkip to search
Episciences
Open Access Journals
Sign in(new window)
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Sign in(new window)
Articles & Issues
All articlesAll accepted articlesAll volumesLast volumeSectionsSpecial issuesAuthors
About
The journalIndexing
Boards
Publish
For authorsEthical charter
Submit
Discrete Mathematics & Theoretical Computer Science logo
Contact
|
Credits
eISSN 1365-8050
|
RSS
|
Atom
Episciences
Documentation
|
Acknowledgements
|
Publishing policy
Accessibility: non-compliant
|
Legal mentions
|
Privacy statement
|
Terms of use
  1. Home > Articles & Issues >
  2. Articles >
  3. On a sequence of Kim ...
Article

On a sequence of Kimberling and its relationship to the Tribonacci word

Lubomíra Dvořáková (1), Edita Pelantová (1), Jeffrey Shallit (2)
(1) Czech Technical University in Prague [ČVUT]
(2) University of Waterloo [UW]
Download article
Open on arXiv
Submitted on
November 14, 2025
Accepted on
March 9, 2026
Published on
March 23, 2026
Last modified on
March 23, 2026
Volume 28
vol. 28:2
Combinatorics
DOI
10.46298/dmtcs.16926
License
Attribution 4.0 International (CC BY 4.0)
Indicators
358
Views
276
Downloads

On a sequence of Kimberling and its relationship to the Tribonacci word

Lubomíra Dvořáková (1), Edita Pelantová (1), Jeffrey Shallit (2)
(1) Czech Technical University in Prague [ČVUT]
(2) University of Waterloo [UW]
Abstract
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$.
Keywords
  • Combinatorics
  • Formal Languages and Automata Theory
Preview
Loading PDF preview...