k-regular sequence
A k-regular sequence is an infinite sequence satisfying recurrence equations of a certain type, in which the nth term is a linear combination of mth terms for some integers m whose base-k representations are close to that of n.
Regular sequences generalize automatic sequences to infinite alphabets.
Definition
Let . An integer sequence is k-regular if the set of sequences
is contained in a finite-dimensional vector space over the field of rational numbers.
Examples
Ruler sequence
Let be the -adic valuation of . The ruler sequence ( A007814) is -regular, and the set
is contained in the -dimensional vector space generated by and the constant sequence . These basis elements lead to the recurrence equations
which, along with initial conditions and , uniquely determine the sequence.
Thue–Morse sequence
Every k-automatic sequence is k-regular.[1] For example, the Thue–Morse sequence is -regular, and
consists of the two sequences and .
Polynomial sequences
If is an integer-valued polynomial, then is k-regular for every .
Properties
The class of k-regular sequences is closed under termwise addition and multiplication.[2]
The nth term in a k-regular sequence grows at most polynomially in n.[3]
Generalizations
The notion of a k-regular sequence can be generalized to a ring as follows. Let be a commutative Noetherian subring of . A sequence with values in is -regular if the -module generated by
is finitely generated.
Notes
References
- Allouche, Jean-Paul; Shallit, Jeffrey (1992), "The ring of k-regular sequences", Theoretical Computer Science, 98: 163–197, doi:10.1016/0304-3975(92)90001-v.
- Allouche, Jean-Paul; Shallit, Jeffrey (2003), "The ring of k-regular sequences, II", Theoretical Computer Science, 307: 3–29, doi:10.1016/s0304-3975(03)00090-2.
- Allouche, Jean-Paul; Shallit, Jeffrey (2003). Automatic Sequences: Theory, Applications, Generalizations. Cambridge University Press. ISBN 978-0-521-82332-6. Zbl 1086.11015.