Thomas French

most citedSubshifts with Slowly Growing Numbers of Follower Sets

10 citations · 11 across the 3 of their papers we have counts for

collaborators

4 papers

math.DS2017

Follower, Predecessor, and Extender Entropies

Thomas French, Ronnie Pavlov

Using follower/predecessor/extender set sequences, we define quantities which we call the follower/predecessor/extender entropies, which can be associated to any shift space. We an…

math.DS2017

Follower, Predecessor, and Extender Set Sequences of $β$ -Shifts

Thomas French

Given a one-dimensional shift $X$ , let $∣ F_{X} (n) ∣$ be the number of follower sets of words of length $n$ in $X$ , and $∣ P_{X} (n) ∣$ be the number of predecessor sets of words of length…

math.DS2015★ 10 cited

Subshifts with Slowly Growing Numbers of Follower Sets

Thomas French, Nic Ormes, Ronnie Pavlov

For any subshift, define $F_{X} (n)$ to be the collection of distinct follower sets of words of length $n$ in $X$ . Based on a similar result of the second and third authors, we conjec…

math.DS2015★ 1 cited

Characterizing Follower and Extender Set Sequences

Thomas French

Given a one-dimensional shift $X$ , let $∣ F_{X} (ℓ) ∣$ be the number of follower sets of words of length $ℓ$ in $X$ . We call the sequence ${∣ F_{X} (ℓ) ∣}_{ℓ \in N}$ t…

Follower, Predecessor, and Extender Entropies

Follower, Predecessor, and Extender Set Sequences of β-Shifts

Subshifts with Slowly Growing Numbers of Follower Sets

Characterizing Follower and Extender Set Sequences

Follower, Predecessor, and Extender Set Sequences of $β$ -Shifts