Jeffrey Shallit

activity

20132026

collaborators

10 papers

math.CO2026

Repetition Avoidance in Curling-Number Transforms

Geoffrey Caveney, Haoxuan, Dong +1

We study repetition avoidance in a word $w$ and its curling-number transform $C (w)$ . For alphabets of sizes $2$ , $3$ , and $4$ , we use Thue-Morse-based morphic construct…

math.CO2026

Palindrome complexity versus factor complexity

Jeffrey Shallit

Let $x = (a_{i})_{i \geq 0}$ be an infinite word over a finite alphabet $Σ$ . Let $ρ (n)$ be the factor complexity function for $x$ and $Pal (n)$ be the palindrome compl…

math.CO2026

Ten Squares Force an Overlap

Jeffrey Shallit

We prove that every concatenation of $10$ or more binary squares contains an overlap. The bound $10$ is best possible. In contrast, over a ternary alphabet, there are infinitely lo…

cs.FL2026

Complexity of Linear Subsequences of Fibonacci-Automatic Sequences

Delaram Moradi, Narad Rampersad, Jeffrey Shallit

We construct automata with input(s) in Fibonacci representation (also known as Zeckendorf representation) recognizing some basic arithmetic relations and study their number of stat…

math.CO2025

The Narayana Morphism and Related Words

Jeffrey Shallit

The Narayana morphism $ν$ maps $0 \to 01$ , $1 \to 2$ , $2 \to 0$ and has a fixed point $n = n_{0} n_{1} n_{2} \dots = 0120010120120 \dots$ . In this…

math.NT2025

The Hurt-Sada Array and Zeckendorf Representations

Jeffrey Shallit

Wesley Ivan Hurt and Ali Sada both independently proposed studying an infinite array where the $0$ 'th row consists of the non-negative integers $0, 1, 2, \dots$ in increasing order.…

math.CO2024

Some Remarks on Palindromic Periodicities

Gabriele Fici, Jeffrey Shallit, Jamie Simpson

We say a finite word $x$ is a palindromic periodicity if there exist two palindromes $p$ and $s$ such that $∣ x ∣ \geq ∣ p s ∣$ and $x$ is a prefix of the word $(p s)^{ω} = p s p s p s \dots$ . I…

math.CO2024

Consecutive Power Occurrences in Sturmian Words

Jason Bell, Chris Schulz, Jeffrey Shallit

We show that every Sturmian word has the property that the distance between consecutive ending positions of cubes occurring in the word is always bounded by $10$ and this bound is…

math.CO2024

Some Fibonacci-Related Sequences

Benoit Cloitre, Jeffrey Shallit

We discuss an interesting sequence defined recursively; namely, sequence A105774 from the On-Line Encyclopedia of Integer Sequences, and study some of its properties. Our main tool…

math.CO2013

Counting the Palstars

L. Bruce Richmond, Jeffrey Shallit

A palstar (after Knuth, Morris, and Pratt) is a concatenation of even-length palindromes. We show that, asymptotically, there are $Θ (α_{k}^{n})$ palstars of length $2 n$ over a $k$ -lett…