2 papers
cs.DS2020
Computational Aspects of Sturdy and Flimsy Numbers
Trevor Clokie, Thomas F. Lidbetter, Antonio Molina Lovett +2
Following Stolarsky, we say that a natural number n is flimsy in base b if some positive multiple of n has smaller digit sum in base b than n does; otherwise it is sturdy. We devel…
cs.FL2019
Circularly squarefree words and unbordered conjugates: a new approach
Trevor Clokie, Daniel Gabric, Jeffrey Shallit
Using a new approach based on automatic sequences, logic, and a decision procedure, we reprove some old theorems about circularly squarefree words and unbordered conjugates in a ne…