Wikipedia

Factorization of polynomials over finite fields: Difference between revisions

Browse history interactively
← Previous edit
Content deleted Content added
VisualWikitext
Rescuing 2 sources and tagging 0 as dead.) #IABot (v2.0.9.5
 
(3 intermediate revisions by 2 users not shown)
Line 124:
The correctness of the algorithm is based on the following:
 
<blockquote>{{Anchor|lemma}}'''Lemma.''' For ''i'' ≥ 1 the polynomial
: <math>x^{q^i}-x \in \mathbf{F}_q[x]</math>
is the product of all monic irreducible polynomials in '''F'''<sub>''q''</sub>[''x''] whose degree divides ''i''.</blockquote>
Line 230:
 
== Rabin's test of irreducibility ==
Like distinct-degree factorization algorithm, Rabin's algorithm<ref>{{cite journal |last1=Rabin |first1=Michael |year=1980 |title=Probabilistic algorithms in finite fields |journal=SIAM Journal on Computing |volume=9 |issue=2 |pages=273–280 |doi=10.1137/0209024 |citeseerx=10.1.1.17.5653 }}</ref> is based on the Lemma[[#lemma|lemma]] stated above. Distinct-degree factorization algorithm tests every ''d'' not greater than half the degree of the input polynomial. Rabin's algorithm takes advantage that the factors are not needed for considering fewer ''d''. Otherwise, it is similar to distinct-degree factorization algorithm. It is based on the following fact.
 
Let ''p''<sub>1</sub>, ..., ''p<sub>k</sub>'', be all the prime divisors of ''n'', and denote <math>n/p_i=n_i</math>, for 1 ≤ ''i'' ≤ ''k'' polynomial ''f'' in '''F'''<sub>''q''</sub>[''x''] of degree ''n'' is irreducible in '''F'''<sub>''q''</sub>[''x''] if and only if <math> \gcd \left (f,x^{q^{n_i}}-x \right )=1</math>, for 1&nbsp;≤&nbsp;''i''&nbsp;≤&nbsp;''k'', and ''f'' divides <math>x^{q^n}-x</math>. In fact, if ''f'' has a factor of degree not dividing ''n'', then ''f'' does not divide <math>x^{q^n}-x</math>; if ''f'' has a factor of degree dividing ''n'', then this factor divides at least one of the <math>x^{q^{n_i}}-x.</math>
Line 275:
* Some irreducible polynomials http://www.math.umn.edu/~garrett/m/algebra/notes/07.pdf
* Field and Galois Theory :http://www.jmilne.org/math/CourseNotes/FT.pdf
* Galois Field:http://designtheory.org/library/encyc/topics/gf.pdf {{Webarchive|url=https://web.archive.org/web/20101215224628/http://designtheory.org/library/encyc/topics/gf.pdf |date=2010-12-15 }}
* Factoring polynomials over finite fields: http://www.science.unitn.it/~degraaf/compalg/polfact.pdf {{Webarchive|url=https://web.archive.org/web/20110721233946/http://www.science.unitn.it/~degraaf/compalg/polfact.pdf |date=2011-07-21 }}
 
[[Category:Polynomials]]
Retrieved from "https://en.wikipedia.org/wiki/Factorization_of_polynomials_over_finite_fields"