Search results

Jump to navigation Jump to search

Page title matches

Page text matches

  • A type of polynomial whose roots generate extensions of degree ''p'' in characteristic ''p''.
    129 bytes (17 words) - 02:24, 5 December 2008
  • ...property of elements of an extension field which satisfy only the trivial polynomial relation.
    134 bytes (18 words) - 15:49, 23 December 2008
  • A number which is not algebraic: that is, does not satisfy any polynomial with integer or rational coefficients.
    148 bytes (21 words) - 15:21, 31 October 2008
  • The highest common factor of the coefficients of a polynomial.
    98 bytes (13 words) - 15:03, 29 October 2008
  • {{r|polynomial equation}} {{r|Polynomial equation}}
    412 bytes (50 words) - 07:01, 12 September 2024
  • {{r|Artin-Schreier polynomial}} {{r|Minimal polynomial}}
    1 KB (133 words) - 07:01, 16 August 2024
  • ...and where one is interested in finding [[solution (equation)|solution]]s. Polynomial equations occur frequently in applications -- typically [[linear equation|l ...[[polynonial equation/Advanced|"Advanced"]] subpage for information about polynomial equations with other types of coefficients.
    4 KB (647 words) - 16:35, 22 December 2008
  • In [[field theory]], an '''Artin-Schreier polynomial''' is a polynomial whose roots are used to generate [[field extension]]s of [[prime number|pri An Artin-Schreier polynomial over a field ''F'' is of the form
    2 KB (299 words) - 12:00, 13 July 2024
  • ...om ''irrational function'' which cannot be written as a [[ratio]] of two [[polynomial]]s. ...and ''t'' are [[polynomial function]] in ''x'' and ''t'' is not the [[zero polynomial]]. The [[domain (mathematics)|domain]] of ''f'' is the set of all points '
    1 KB (234 words) - 05:28, 9 December 2008
  • ...et of primitive [[root of unity|roots of unity]]. The ''n''-th cyclotomic polynomial, denoted by Φ<sub>''n''</sub> has [[integer]] cofficients.
    1 KB (210 words) - 17:01, 3 August 2024
  • An invariant of a polynomial which vanishes if it has a repeated root: the product of the differences be
    156 bytes (24 words) - 16:29, 3 December 2008
  • ...acci polynomials''' are a generalization of [[Fibonacci number]]s. These [[polynomial]]s are defined by: *[[Polynomial sequence]]s[[Category:Suggestion Bot Tag]]
    725 bytes (115 words) - 07:01, 16 August 2024
  • ...is a [[polynomial]] equation, whereas the second cannot be represented by polynomial equations. The first approximation of the adjective ''algebraic'' could be ..., a set of points in <math>\scriptstyle \mathbb{K}^n </math> that satisfy polynomial equations with coefficients in the field <math>\scriptstyle \mathbb{K}.</ma
    2 KB (291 words) - 12:01, 8 July 2024
  • Auto-populated based on [[Special:WhatLinksHere/Minimal polynomial]]. Needs checking by a human. {{r|Characteristic polynomial}}
    765 bytes (96 words) - 17:01, 19 September 2024
  • {{r|Characteristic polynomial}}
    191 bytes (21 words) - 12:52, 31 May 2009
  • Auto-populated based on [[Special:WhatLinksHere/Characteristic polynomial]]. Needs checking by a human. {{r|Minimal polynomial}}
    743 bytes (91 words) - 17:00, 26 July 2024
  • {{r|Polynomial}} {{r|Discriminant of a polynomial}}
    879 bytes (140 words) - 17:59, 21 December 2008
  • The ring of elements of an extension of a ring which satisfy a monic polynomial over the base ring.
    135 bytes (22 words) - 13:39, 1 January 2009
  • {{r|Characteristic polynomial}} {{r|Minimal polynomial}}
    1 KB (129 words) - 17:00, 10 August 2024
  • ...ety]] is a point for which the coordinates have the property that the only polynomial relations that hold among them are the defining equations of the variety it ...nction field]] '''R'''(''t'') is generic, as it is on the circle but every polynomial relation between the coordinates is deducible from the relation ''X''<sup>2
    1 KB (244 words) - 17:01, 20 August 2024
View ( | ) (20 | 50 | 100 | 250 | 500)