Recent Issues |
| Volume 5, Issue 3 |
| Volume 5, Issue 2 |
| Volume 5, Issue 1 |
| Volume 4, Issue 4 |
| Volume 4, Issue 3 |
| Volume 4, Issue 2 |
| Volume 4, Issue 1 |
| Volume 3, Issue 4 |
| Volume 3, Issue 3 |
| Volume 3, Issue 2 |
| Volume 3, Issue 1 |
| Volume 2, Issue 5 |
| Volume 2, Issue 4 |
| Volume 2, Issue 3 |
| Volume 2, Issue 2 |
| Volume 2, Issue 1 |
| Volume 1, Issue 2 |
| Volume 1, Issue 1 |
|
|
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 Zm[ω] = Zm[x] ∕ ⟨f⟩. When m = p
is prime, this order can be described in terms of the factorization of f in the
polynomial ring Zp[x]. We use this connection to develop efficient algorithms for
determining the factorization types of monic polynomials of degree k ≤ 5 in
Zp[x].
|
Keywords
linear homogeneous recurrence relations, polynomial
congruences, finite rings, finite fields
|
Mathematical Subject Classification 2000
Primary: 11B50, 11C08, 11T06
|
Milestones
Received: 29 October 2007
Accepted: 26 January 2010
Published: 11 August 2010
|
|
|
|
|