52 citations · 188 across the 37 of their papers we have counts for
15 papers · 1 filter
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…
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…
Lucas congruences for the Apéry numbers modulo
Eric Rowland, Reem Yassawi, Christian Krattenthaler
The sequence of Apéry numbers can be interpolated to by an entire function. We give a formula for the Taylor coefficients of this function, centered…
A matrix generalization of a theorem of Fine
Eric Rowland
In 1947 Nathan Fine gave a beautiful product for the number of binomial coefficients , for in the range , that are not divisible by . We give…
-adic asymptotic properties of constant-recursive sequences
Eric Rowland, Reem Yassawi
In this article we study -adic properties of sequences of integers (or -adic integers) that satisfy a linear recurrence with constant coefficients. For such a sequence, we gi…