When.com Web Search

Search results

  1. Results From The WOW.Com Content Network
  2. 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).

  3. Examples of vector spaces - Wikipedia

    en.wikipedia.org/wiki/Examples_of_vector_spaces

    The set of polynomials with coefficients in F is a vector space over F, denoted F[x]. Vector addition and scalar multiplication are defined in the obvious manner. If the degree of the polynomials is unrestricted then the dimension of F[x] is countably infinite.

  4. Finite field - Wikipedia

    en.wikipedia.org/wiki/Finite_field

    If F is a finite field, a non-constant monic polynomial with coefficients in F is irreducible over F, if it is not the product of two non-constant monic polynomials, with coefficients in F. As every polynomial ring over a field is a unique factorization domain, every monic polynomial over a finite field may be factored in a unique way (up to ...

  5. Degree of a field extension - Wikipedia

    en.wikipedia.org/wiki/Degree_of_a_field_extension

    Suppose that E/F is a field extension. Then E may be considered as a vector space over F (the field of scalars). The dimension of this vector space is called the degree of the field extension, and it is denoted by [E:F]. The degree may be finite or infinite, the field being called a finite extension or infinite extension accordingly.

  6. Separable extension - Wikipedia

    en.wikipedia.org/wiki/Separable_extension

    An arbitrary polynomial f with coefficients in some field F is said to have distinct roots or to be square-free if it has deg f roots in some extension field.For instance, the polynomial g(X) = X 2 − 1 has precisely deg g = 2 roots in the complex plane; namely 1 and −1, and hence does have distinct roots.

  7. Finitely generated algebra - Wikipedia

    en.wikipedia.org/wiki/Finitely_generated_algebra

    The polynomial algebra [, …,] is finitely generated. The polynomial algebra in countably infinitely many generators is infinitely generated.; The field = of rational functions in one variable over an infinite field is not a finitely generated algebra over .

  8. Hilbert's basis theorem - Wikipedia

    en.wikipedia.org/wiki/Hilbert's_basis_theorem

    Hilbert proved the theorem (for the special case of multivariate polynomials over a field) in the course of his proof of finite generation of rings of invariants. [1] The theorem is interpreted in algebraic geometry as follows: every algebraic set is the set of the common zeros of finitely many polynomials.

  9. Polynomial - Wikipedia

    en.wikipedia.org/wiki/Polynomial

    The zero polynomial is also unique in that it is the only polynomial in one indeterminate that has an infinite number of roots. The graph of the zero polynomial, f(x) = 0, is the x-axis. In the case of polynomials in more than one indeterminate, a polynomial is called homogeneous of degree n if all of its non-zero terms have degree n. The zero ...