✦ LIBER ✦

Factoring Polynomials Over Local Fields

✍ Scribed by Sebastian Pauli

Publisher: Elsevier Science
Year: 2001
Tongue: English
Weight: 361 KB
Volume: 32
Category: Article
ISSN: 0747-7171
DOI: 10.1006/jsco.2001.0493

No coin nor oath required. For personal study only.

✦ Synopsis

We describe an efficient new algorithm for factoring a polynomial Φ(x) over a field k that is complete with respect to a discrete prime divisor. For every irreducible factor ϕ(x) of Φ(x) this algorithm returns an integral basis for k[x]/ϕ(x)k[x] over k.

📜 SIMILAR VOLUMES

Factoring Polynomials over Special Finit

Factoring Polynomials over Special Finite Fields

✍ Eric Bach; Joachim von zur Gathen; Hendrik W. Lenstra Jr. 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 227 KB

We exhibit a deterministic algorithm for factoring polynomials in one variable over "nite "elds. It is e$cient only if a positive integer k is known for which I (p) is built up from small prime factors; here I denotes the kth cyclotomic polynomial, and p is the characteristic of the "eld. In the cas

Factoring Dickson Polynomials over Finit

Factoring Dickson Polynomials over Finite Fields

✍ Manjul Bhargava; Michael E. Zieve 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 105 KB

Factoring Polynomials Over Finite Fields

Factoring Polynomials Over Finite Fields: A Survey

✍ Joachim von zur Gathen; Daniel Panario 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 452 KB

This survey reviews several algorithms for the factorization of univariate polynomials over finite fields. We emphasize the main ideas of the methods and provide an up-to-date bibliography of the problem.

The Factorization of Dickson Polynomials

The Factorization of Dickson Polynomials over Finite Fields

✍ Wun-Seng Chou 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 257 KB

Let T n (x, a) ʦ GF(q)[x] be a Dickson polynomial over the finite field GF(q) of either the first kind or the second kind of degree n in the indeterminate x and with parameter a. We give a complete description of the factorization of T n (x, a) over GF(q).

Factorization of Polynomials over Finite

Factorization of Polynomials over Finite Fields and Characteristic Sequences

✍ Harald Niederreiter; Rainer Göttfert 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 360 KB

Orthogonal Sequences of Polynomials over

Orthogonal Sequences of Polynomials over Arbitrary Fields

✍ Simon R. Blackburn 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 325 KB

Let f and g be polynomials over some field, thought of as elements of the ring of one-sided Laurent series, and suppose that deg f<deg g. The quotient fÂg is badly approximable if all the partial quotients of the continued fraction expansion of fÂg have degree 1. We investigate the set of polynomial