enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. Casus irreducibilis - Wikipedia

    en.wikipedia.org/wiki/Casus_irreducibilis

    Casus irreducibilis (from Latin 'the irreducible case') is the name given by mathematicians of the 16th century to cubic equations that cannot be solved in terms of real radicals, that is to those equations such that the computation of the solutions cannot be reduced to the computation of square and cube roots.

  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. Painlevé transcendents - Wikipedia

    en.wikipedia.org/wiki/Painlevé_transcendents

    It was a controversial open problem for many years to show that these six equations really were irreducible for generic values of the parameters (they are sometimes reducible for special parameter values; see below), but this was finally proved by Nishioka (1988) and Hiroshi Umemura . These six second order nonlinear differential equations are ...

  5. Irreducibility (mathematics) - Wikipedia

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

    It applies in various situations, for example to irreducibility of a linear representation, or of an algebraic variety; where it means just the same as irreducible over an algebraic closure. In commutative algebra, a commutative ring R is irreducible if its prime spectrum, that is, the topological space Spec R, is an irreducible topological space.

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

  7. Hilbert's irreducibility theorem - Wikipedia

    en.wikipedia.org/wiki/Hilbert's_irreducibility...

    To see this, choose a monic irreducible polynomial f(X 1, ..., X n, Y) whose root generates N over E. If f(a 1, ..., a n, Y) is irreducible for some a i, then a root of it will generate the asserted N 0.) Construction of elliptic curves with large rank. [2] Hilbert's irreducibility theorem is used as a step in the Andrew Wiles proof of Fermat's ...

  8. Degenerate conic - Wikipedia

    en.wikipedia.org/wiki/Degenerate_conic

    In geometry, a degenerate conic is a conic (a second-degree plane curve, defined by a polynomial equation of degree two) that fails to be an irreducible curve.This means that the defining equation is factorable over the complex numbers (or more generally over an algebraically closed field) as the product of two linear polynomials.

  9. Representation theory of the symmetric group - Wikipedia

    en.wikipedia.org/wiki/Representation_theory_of...

    There are now fewer irreducibles, and although they can be classified they are very poorly understood. For example, even their dimensions are not known in general. The determination of the irreducible modules for the symmetric group over an arbitrary field is widely regarded as one of the most important open problems in representation theory.