inert absolute irreducibility function
(optional) set or list of prime integers
The AIrreduc function is a placeholder for testing the absolute irreducibility of the polynomial P, that is irreducibility over an algebraic closure of its coefficient field. It is used in conjunction with evala.
The call evala(AIrreduc(P)) tests the absolute irreducibility of the polynomial P over the field of complex numbers. The polynomial P must have algebraic number coefficients in RootOf notation (see algnum).
A univariate polynomial is absolutely irreducible if and only if it is of degree 1.
The function AIrreduc looks for sufficient conditions of absolute reducibility or irreducibility. It returns true if the polynomial P is detected absolutely irreducible, false if it is detected absolutely reducible, FAIL otherwise.
In the case of nonrational coefficients, only trivial conditions are tested.
If the polynomial P has rational coefficients, an absolute irreducibility criterion is sought over the reduction of P modulo p, where p runs through a set of prime integers. If S is given, the primes in S are used. Otherwise, the first ten odd primes and the first five primes greater than the degree of P are chosen. Although the probability for P to be absolutely reducible in case of failure is not controlled, it is very likely that P can be factored.
f ≔ 92⁢x9⁢y−93⁢x2⁢y2+91⁢x7⁢y3+y4+x10
f ≔ a⁢y3+a⁢y3⁢x+13⁢a⁢y2−7⁢x⁢y−7⁢x2⁢y−91⁢x
f ≔ −2⁢y2⁢x2+y2+10⁢x2⁢y+25⁢x4
The following polynomial is absolutely irreducible, but has been specially constructed to deceive the test. This example illustrates the usefulness of the optional argument.
f ≔ 48778⁢x3+275894451⁢y6−1188761805⁢y5⁢x+1707361425⁢y4⁢x2−817400375⁢x3⁢y3+1232777⁢y3
Ragot, Jean-Francois. "Probabilistic Absolute Irreducibility Test of Polynomials." In Proceedings of MEGA '98. 1998.
Download Help Document
What kind of issue would you like to report? (Optional)
Thank you for submitting feedback on this help document. Your feedback will be used
to improve Maple's help in the future.