52 citations · 188 across the 37 of their papers we have counts for
38 papers
An elementary proof of Bridy's theorem
Eric Rowland, Manon Stipulanti, Reem Yassawi
Christol's theorem states that a power series with coefficients in a finite field is algebraic if and only if its coefficient sequence is automatic. A natural question is how the s…
A natural bijection for contiguous pattern avoidance in words
Julia Carrigan, Isaiah Hollars, Eric Rowland
Two words and are avoided by the same number of length- words, for all , precisely when and have the same set of border lengths. Previous proofs of this theor…
The lexicographically least square-free word with a given prefix
Siddharth Berera, Andrés Gómez-Colunga, Joey Lakerdas-Gayle +6
The lexicographically least square-free infinite word on the alphabet of non-negative integers with a given prefix is denoted . When is the empty word, this word was…
Limiting density of the Fibonacci sequence modulo powers of a prime
Nicholas Bragman, Eric Rowland
For a given prime , we determine the limit, as , of the density of residues modulo attained by the Fibonacci sequence. In particular, we show that this limiti…
Lucas' theorem modulo
Eric Rowland
Lucas' theorem describes how to reduce a binomial coefficient modulo by breaking off the least significant digits of and in base . We characterize the…
Avoiding 5/4-powers on the alphabet of nonnegative integers
Eric Rowland, Manon Stipulanti
We identify the structure of the lexicographically least word avoiding 5/4-powers on the alphabet of nonnegative integers. Specifically, we show that this word has the form $p τ(φ(…