Reducibility type of polynomials modulo a prime

Fibonacci and Lucas numbers and polynomials and generalizations (11B39) Algebraic numbers; rings of algebraic integers (11R04) Polynomials (irreducibility, etc.) (11R09) Algebraic field extensions (12F05)

Review text

For a monic irreducible element \(f(x)\) of the ring \(\mathbb{Z}[x]\) with degree \(n\geq 2,\) let \(U_{f}=(u_{k})_{k\geq 0}\) be the \(n\)th order linear recurrence sequence with characteristic polynomial \(f,\) and initial conditions \(u_{0}=u_{1}=\cdots =u_{n-2}=0\) and \(u_{n-1}=1\). Also, let \(d_{1},\dots,d_{t}\) denote the degrees of the distinct monic irreducible factors of \(f(x)\) modulo \(p,\) where \(p>n\) is a prime number not dividing the discriminant of the polynomial \(f\).\N\NIn the paper under review, the authors show that if \(f(x)\) is cubic, then the values of particular terms (at most two among the first \(p^{2}+p+2\) ones) of the sequence \(U_{f}\) modulo \(p\) give the exact values of the degrees \(d_{1},\dots,d_{t}\). A similar result is proved when \(f\) runs through certain families of quartic and sextic cyclic polynomials.

Cites work

This page was built for publication: Reducibility type of polynomials modulo a prime

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6968188)