Eric Rowland
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Research Interests
Eric Rowland has a total of 34 co-authors. Here are the top co-authors by number of shared publications:
- Lara Pudwell
Valparaiso University
3 shared publications Doron Zeilberger
Department of Mathematics, Rutgers University, New Brunswick, Piscataway, NJ 08854, USA
2 shared publicationsJeffrey Shallit
2 shared publications- Luis A. Medina
University of Puerto Rico
2 shared publications - Manon Stipulanti
Department of Mathematics University of Liège Belgium
2 shared publications Reem Yassawi
2 shared publications
Latest Publications
- Open Access
- 10 September 2025
- Published by Springer Nature in Research in Number Theory
- Vol. 11 (4) , 1-21
Limiting density of the Fibonacci sequence modulo powers of a prime
For a given prime p , we determine the limit, as $$\lambda \rightarrow \infty $$ , of the density of residues modulo $$p^\lambda $$ attained by the Fibonacci sequence. In particular, we show that this limiting density is related to zeros in the sequence of Lucas numbers modulo p . The proof uses a piecewise interpolation of the Fibonacci sequence to the p -adic numbers and a characterization of Wall–Sun–Sun primes p in terms of the p -adic absolute value of a number related to the p -adic golden ratio.- 10 September 2025
- Published by Springer Nature in Research in Number Theory
- Vol. 11 (4) , 1-21
Open AccessLimiting density of the Fibonacci sequence modulo powers of a prime
For a given prime p , we determine the limit, as $$\lambda \rightarrow \infty $$ , of the density of residues modulo $$p^\lambda $$ attained by the Fibonacci sequence. In particular, we show that this limiting density is related to zeros in the sequence of Lucas numbers modulo p . The proof uses a piecewise interpolation of the Fibonacci sequence to the p -adic numbers and a characterization of Wall–Sun–Sun primes p in terms of the p -adic absolute value of a number related to the p -adic golden ratio. - Open Access
Magic numbers in periodic sequences
In formal languages and automata theory, the magic number problem can be formulated as follows: for a given integer n, is it possible to find a number d in the range [n,2^n] such that there is no minimal deterministic finite automaton with d states that can be simulated by an optimal nondeterministic finite automaton with exactly n states? If such a number d exists, it is called magic. In this paper, we consider the magic number problem in the framework of deterministic automata with output, which are known to characterize automatic sequences. More precisely, we investigate magic numbers for periodic sequences viewed as either automatic, regular, or constant-recursive.
Open AccessMagic numbers in periodic sequences
In formal languages and automata theory, the magic number problem can be formulated as follows: for a given integer n, is it possible to find a number d in the range [n,2^n] such that there is no minimal deterministic finite automaton with d states that can be simulated by an optimal nondeterministic finite automaton with exactly n states? If such a number d exists, it is called magic. In this paper, we consider the magic number problem in the framework of deterministic automata with output, which are known to characterize automatic sequences. More precisely, we investigate magic numbers for periodic sequences viewed as either automatic, regular, or constant-recursive.
- 25 May 2022
- Published by Taylor & Francis in The American Mathematical Monthly
- Vol. 129 (9) , 846-855
Lucas’ Theorem Modulo p2
Lucas’ theorem describes how to reduce a binomial coefficient modulo p by breaking off the least significant digits of a and b in base p. We characterize the pairs of these digits for which Lucas’ theorem holds modulo p2. This characterization is naturally expressed using symmetries of Pascal’s triangle.- 25 May 2022
- Published by Taylor & Francis in The American Mathematical Monthly
- Vol. 129 (9) , 846-855
Lucas’ Theorem Modulo p2
Lucas’ theorem describes how to reduce a binomial coefficient modulo p by breaking off the least significant digits of a and b in base p. We characterize the pairs of these digits for which Lucas’ theorem holds modulo p2. This characterization is naturally expressed using symmetries of Pascal’s triangle.- Open Access
Ultimate periodicity problem for linear numeration systems
We address the following decision problem. Given a numeration system $U$ and a $U$-recognizable set $X\subseteq\mathbb{N}$, i.e. the set of its greedy $U$-representations is recognized by a finite automaton, decide whether or not $X$ is ultimately periodic. We prove that this problem is decidable for a large class of numeration systems built on linearly recurrent sequences. Based on arithmetical considerations about the recurrence equation and on $p$-adic methods, the DFA given as input provides a bound on the admissible periods to test.Open AccessUltimate periodicity problem for linear numeration systems
We address the following decision problem. Given a numeration system $U$ and a $U$-recognizable set $X\subseteq\mathbb{N}$, i.e. the set of its greedy $U$-representations is recognized by a finite automaton, decide whether or not $X$ is ultimately periodic. We prove that this problem is decidable for a large class of numeration systems built on linearly recurrent sequences. Based on arithmetical considerations about the recurrence equation and on $p$-adic methods, the DFA given as input provides a bound on the admissible periods to test. - 26 May 2020
- Published by Springer Nature
- Vol. 12086, 280-293
Avoiding 5/4-Powers on the Alphabet of Nonnegative Integers (Extended Abstract)
We identify the structure of the lexicographically least word avoiding 5/4-powers on the alphabet of nonnegative integers.
- 26 May 2020
- Published by Springer Nature
- Vol. 12086, 280-293
Avoiding 5/4-Powers on the Alphabet of Nonnegative Integers (Extended Abstract)
We identify the structure of the lexicographically least word avoiding 5/4-powers on the alphabet of nonnegative integers.
- Open Access
- 5 September 2019
- Published by Canadian Mathematical Society in Canadian Journal of Mathematics
- Vol. 72 (6) , 1691-1726
Automaticity and Invariant Measures of Linear Cellular Automata
We show that spacetime diagrams of linear cellular automata $\unicode[STIX]{x1D6F7}:\,\mathbb{F}_{p}^{\mathbb{Z}}\rightarrow \mathbb{F}_{p}^{\mathbb{Z}}$ with $(-p)$ -automatic initial conditions are automatic. This extends existing results on initial conditions that are eventually constant. Each automatic spacetime diagram defines a $(\unicode[STIX]{x1D70E},\unicode[STIX]{x1D6F7})$ -invariant subset of $\mathbb{F}_{p}^{\mathbb{Z}}$ , where $\unicode[STIX]{x1D70E}$ is the left shift map, and if the initial condition is not eventually periodic, then this invariant set is nontrivial. For the Ledrappier cellular automaton we construct a family of nontrivial $(\unicode[STIX]{x1D70E},\unicode[STIX]{x1D6F7})$ -invariant measures on $\mathbb{F}_{3}^{\mathbb{Z}}$ . Finally, given a linear cellular automaton $\unicode[STIX]{x1D6F7}$ , we construct a nontrivial $(\unicode[STIX]{x1D70E},\unicode[STIX]{x1D6F7})$ -invariant measure on $\mathbb{F}_{p}^{\mathbb{Z}}$ for all but finitely many $p$ .- 5 September 2019
- Published by Canadian Mathematical Society in Canadian Journal of Mathematics
- Vol. 72 (6) , 1691-1726
Open AccessAutomaticity and Invariant Measures of Linear Cellular Automata
We show that spacetime diagrams of linear cellular automata $\unicode[STIX]{x1D6F7}:\,\mathbb{F}_{p}^{\mathbb{Z}}\rightarrow \mathbb{F}_{p}^{\mathbb{Z}}$ with $(-p)$ -automatic initial conditions are automatic. This extends existing results on initial conditions that are eventually constant. Each automatic spacetime diagram defines a $(\unicode[STIX]{x1D70E},\unicode[STIX]{x1D6F7})$ -invariant subset of $\mathbb{F}_{p}^{\mathbb{Z}}$ , where $\unicode[STIX]{x1D70E}$ is the left shift map, and if the initial condition is not eventually periodic, then this invariant set is nontrivial. For the Ledrappier cellular automaton we construct a family of nontrivial $(\unicode[STIX]{x1D70E},\unicode[STIX]{x1D6F7})$ -invariant measures on $\mathbb{F}_{3}^{\mathbb{Z}}$ . Finally, given a linear cellular automaton $\unicode[STIX]{x1D6F7}$ , we construct a nontrivial $(\unicode[STIX]{x1D70E},\unicode[STIX]{x1D6F7})$ -invariant measure on $\mathbb{F}_{p}^{\mathbb{Z}}$ for all but finitely many $p$ . - 14 July 2018
- Published by Springer Nature
- p. 414-421
IntegerSequences: A Package for Computing with k-Regular Sequences
- 14 July 2018
- Published by Springer Nature
- p. 414-421
IntegerSequences: A Package for Computing with k-Regular Sequences
- Open Access
- 13 April 2018
- Published by The Electronic Journal of Combinatorics in The Electronic Journal of Combinatorics
- Vol. 25 (2) , P2.27
Avoiding Fractional Powers over the Natural Numbers
We study the lexicographically least infinite $a/b$-power-free word on the alphabet of non-negative integers. Frequently this word is a fixed point of a uniform morphism, or closely related to one. For example, the lexicographically least $7/4$-power-free word is a fixed point of a $50847$-uniform morphism. We identify the structure of the lexicographically least $a/b$-power-free word for three infinite families of rationals $a/b$ as well many "sporadic" rationals that do not seem to belong to general families. To accomplish this, we develop an automated procedure for proving $a/b$-power-freeness for morphisms of a certain form, both for explicit and symbolic rational numbers $a/b$. Finally, we establish a connection to words on a finite alphabet. Namely, the lexicographically least $27/23$-power-free word is in fact a word on the finite alphabet $\{0, 1, 2\}$, and its sequence of letters is $353$-automatic.- 13 April 2018
- Published by The Electronic Journal of Combinatorics in The Electronic Journal of Combinatorics
- Vol. 25 (2) , P2.27
Open AccessAvoiding Fractional Powers over the Natural Numbers
We study the lexicographically least infinite $a/b$-power-free word on the alphabet of non-negative integers. Frequently this word is a fixed point of a uniform morphism, or closely related to one. For example, the lexicographically least $7/4$-power-free word is a fixed point of a $50847$-uniform morphism. We identify the structure of the lexicographically least $a/b$-power-free word for three infinite families of rationals $a/b$ as well many "sporadic" rationals that do not seem to belong to general families. To accomplish this, we develop an automated procedure for proving $a/b$-power-freeness for morphisms of a certain form, both for explicit and symbolic rational numbers $a/b$. Finally, we establish a connection to words on a finite alphabet. Namely, the lexicographically least $27/23$-power-free word is in fact a word on the finite alphabet $\{0, 1, 2\}$, and its sequence of letters is $353$-automatic. - Open Access
Periodicity in the $p$-adic valuation of a polynomial
For a prime $p$ and an integer $x$, the $p$-adic valuation of $x$ is denoted by $\nu_{p}(x)$. For a polynomial $Q$ with integer coefficients, the sequence of valuations $\nu_{p}(Q(n))$ is shown to be either periodic or unbounded. The first case corresponds to the situation where $Q$ has no roots in the ring of $p$-adic integers. In the periodic situation, the period length is determined.Open AccessPeriodicity in the $p$-adic valuation of a polynomial
For a prime $p$ and an integer $x$, the $p$-adic valuation of $x$ is denoted by $\nu_{p}(x)$. For a polynomial $Q$ with integer coefficients, the sequence of valuations $\nu_{p}(Q(n))$ is shown to be either periodic or unbounded. The first case corresponds to the situation where $Q$ has no roots in the ring of $p$-adic integers. In the periodic situation, the period length is determined.