enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. Irreducible polynomial - Wikipedia

    en.wikipedia.org/wiki/Irreducible_polynomial

    Irreducible polynomial. In mathematics, an irreducible polynomial is, roughly speaking, a polynomial that cannot be factored into the product of two non-constant polynomials. The property of irreducibility depends on the nature of the coefficients that are accepted for the possible factors, that is, the ring to which the coefficients of the ...

  3. Eisenstein's criterion - Wikipedia

    en.wikipedia.org/wiki/Eisenstein's_criterion

    The fact that the polynomial after substitution is irreducible then allows concluding that the original polynomial is as well. This procedure is known as applying a shift . For example consider H = x 2 + x + 2 , in which the coefficient 1 of x is not divisible by any prime, Eisenstein's criterion does not apply to H .

  4. Irreducibility (mathematics) - Wikipedia

    en.wikipedia.org/wiki/Irreducibility_(mathematics)

    Irreducibility (mathematics) In mathematics, the concept of irreducibility is used in several ways. A polynomial over a field may be an irreducible polynomial if it cannot be factored over that field. In abstract algebra, irreducible can be an abbreviation for irreducible element of an integral domain; for example an irreducible polynomial.

  5. Finite field - Wikipedia

    en.wikipedia.org/wiki/Finite_field

    For applying the above general construction of finite fields in the case of GF(p 2), one has to find an irreducible polynomial of degree 2. For p = 2, this has been done in the preceding section. If p is an odd prime, there are always irreducible polynomials of the form X 2 − r, with r in GF(p).

  6. Semisimple representation - Wikipedia

    en.wikipedia.org/wiki/Semisimple_representation

    Let V be a representation of a group G; or more generally, let V be a vector space with a set of linear endomorphisms acting on it. In general, a vector space acted on by a set of linear endomorphisms is said to be simple (or irreducible) if the only invariant subspaces for those operators are zero and the vector space itself; a semisimple representation then is a direct sum of simple ...

  7. Cyclotomic polynomial - Wikipedia

    en.wikipedia.org/wiki/Cyclotomic_polynomial

    In mathematics, the nth cyclotomic polynomial, for any positive integer n, is the unique irreducible polynomial with integer coefficients that is a divisor of and is not a divisor of for any k < n. Its roots are all n th primitive roots of unity e 2 i π k n {\displaystyle e^{2i\pi {\frac {k}{n}}}} , where k runs over the positive integers less ...

  8. Casus irreducibilis - Wikipedia

    en.wikipedia.org/wiki/Casus_irreducibilis

    Casus irreducibilis can be generalized to higher degree polynomials as follows. Let p ∈ F[x] be an irreducible polynomial which splits in a formally real extension R of F (i.e., p has only real roots). Assume that p has a root in which is an extension of F by radicals.

  9. Tschirnhaus transformation - Wikipedia

    en.wikipedia.org/wiki/Tschirnhaus_transformation

    Definition. For a generic degree reducible monic polynomial equation of the form , where and are polynomials and does not vanish at , the Tschirnhaus transformation is the function: Such that the new equation in , , has certain special properties, most commonly such that some coefficients, , are identically zero. [2][3]