When.com Web Search

Search results

  1. Results From The WOW.Com Content Network
  2. Unique factorization domain - Wikipedia

    en.wikipedia.org/wiki/Unique_factorization_domain

    If R is a UFD, then so is R[X], the ring of polynomials with coefficients in R. Unless R is a field, R[X] is not a principal ideal domain. By induction, a polynomial ring in any number of variables over any UFD (and in particular over a field or over the integers) is a UFD.

  3. Gauss's lemma (polynomials) - Wikipedia

    en.wikipedia.org/wiki/Gauss's_lemma_(polynomials)

    This implies that, if R is either a field, the ring of integers, or a unique factorization domain, then every polynomial ring (in one or several indeterminates) over R is a unique factorization domain. Another consequence is that factorization and greatest common divisor computation of polynomials with integers or rational coefficients may be ...

  4. Polynomial ring - Wikipedia

    en.wikipedia.org/wiki/Polynomial_ring

    In other words, a multivariate polynomial ring can be considered as a univariate polynomial over a smaller polynomial ring. This is commonly used for proving properties of multivariate polynomial rings, by induction on the number of indeterminates. The main such properties are listed below.

  5. Factorization of polynomials over finite fields - Wikipedia

    en.wikipedia.org/wiki/Factorization_of...

    Irreducible polynomials over finite fields are also useful for pseudorandom number generators using feedback shift registers and discrete logarithm over F 2 n. The number of irreducible monic polynomials of degree n over F q is the number of aperiodic necklaces, given by Moreau's necklace-counting function M q (n).

  6. Laurent polynomial - Wikipedia

    en.wikipedia.org/wiki/Laurent_polynomial

    The ring of Laurent polynomials over a field is Noetherian (but not Artinian). If R {\displaystyle R} is an integral domain , the units of the Laurent polynomial ring R [ X , X − 1 ] {\displaystyle R\left[X,X^{-1}\right]} have the form u X k {\displaystyle uX^{k}} , where u {\displaystyle u} is a unit of R {\displaystyle R} and k ...

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

  8. Polynomial identity ring - Wikipedia

    en.wikipedia.org/wiki/Polynomial_identity_ring

    More generally, the free algebra over any ring S may be used, and gives the concept of PI-algebra. If the degree of the polynomial P is defined in the usual way, the polynomial P is called monic if at least one of its terms of highest degree has coefficient equal to 1. Every commutative ring is a PI-ring, satisfying the polynomial identity XY ...

  9. Primitive part and content - Wikipedia

    en.wikipedia.org/wiki/Primitive_part_and_content

    A polynomial ring over a field is a unique factorization domain. The same is true for a polynomial ring over a unique factorization domain. To prove this, it suffices to consider the univariate case, as the general case may be deduced by induction on the number of indeterminates.