enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. Irreducibility (mathematics) - Wikipedia

    en.wikipedia.org/wiki/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.

  3. Irreducible polynomial - Wikipedia

    en.wikipedia.org/wiki/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 polynomial and its possible factors are supposed to belong.

  4. Irreducible component - Wikipedia

    en.wikipedia.org/wiki/Irreducible_component

    These concepts can be reformulated in purely topological terms, using the Zariski topology, for which the closed sets are the algebraic subsets: A topological space is irreducible if it is not the union of two proper closed subsets, and an irreducible component is a maximal subspace (necessarily closed) that is irreducible for the induced topology.

  5. Eisenstein's criterion - Wikipedia

    en.wikipedia.org/wiki/Eisenstein's_criterion

    In particular the constant terms of G and H vanish in the reduction, so they are divisible by p, but then the constant term of Q, which is their product, is divisible by p 2, contrary to the hypothesis, and one has a contradiction. A second proof of Eisenstein's criterion also starts with the assumption that the polynomial Q(x) is reducible. It ...

  6. Irreducible element - Wikipedia

    en.wikipedia.org/wiki/Irreducible_element

    This equivalence does not hold for general commutative rings, which is why the assumption of the ring having no nonzero zero divisors is commonly made in the definition of irreducible elements. It results also that there are several ways to extend the definition of an irreducible element to an arbitrary commutative ring. [1]

  7. Absolute irreducibility - Wikipedia

    en.wikipedia.org/wiki/Absolute_irreducibility

    Absolute irreducibility more generally holds over any field not of characteristic two. In characteristic two, the equation is equivalent to (x + y −1) 2 = 0. Hence it defines the double line x + y =1, which is a non-reduced scheme. The algebraic variety given by the equation + = is not absolutely irreducible.

  8. 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 ...

  9. Irreducible representation - Wikipedia

    en.wikipedia.org/wiki/Irreducible_representation

    In mathematics, specifically in the representation theory of groups and algebras, an irreducible representation (,) or irrep of an algebraic structure is a nonzero representation that has no proper nontrivial subrepresentation (|,), with closed under the action of {():}.