Open Access
2010 Recursive sequences and polynomial congruences
J. Lehman, Christopher Triola
Involve 3(2): 129-148 (2010). DOI: 10.2140/involve.2010.3.129

Abstract

We consider the periodicity of recursive sequences defined by linear homogeneous recurrence relations of arbitrary order, when they are reduced modulo a positive integer m. We show that the period of such a sequence with characteristic polynomial f can be expressed in terms of the order of ω=x+f as a unit in the quotient ring m[ω]=m[x]f. When m=p is prime, this order can be described in terms of the factorization of f in the polynomial ring p[x]. We use this connection to develop efficient algorithms for determining the factorization types of monic polynomials of degree k5 in p[x].

Citation

Download Citation

J. Lehman. Christopher Triola. "Recursive sequences and polynomial congruences." Involve 3 (2) 129 - 148, 2010. https://doi.org/10.2140/involve.2010.3.129

Information

Received: 29 October 2007; Accepted: 26 January 2010; Published: 2010
First available in Project Euclid: 20 December 2017

zbMATH: 1269.11015
MathSciNet: MR2718873
Digital Object Identifier: 10.2140/involve.2010.3.129

Subjects:
Primary: 11B50 , 11C08 , 11T06

Keywords: finite fields , finite rings , linear homogeneous recurrence relations , polynomial congruences

Rights: Copyright © 2010 Mathematical Sciences Publishers

Vol.3 • No. 2 • 2010
MSP
Back to Top