Search results
Jump to navigation
Jump to search
- {{r|Minimal polynomial}}550 bytes (71 words) - 15:57, 11 January 2010
- ** The [[polynomial ring]] over a field #'''Hilbert's Basis Theorem''': The [[polynomial ring]] <math>A[X]</math> is Noetherian (hence so is <math>A[X_1,\ldots,X_n]2 KB (326 words) - 09:55, 23 December 2008
- ...eld extension]] ''E''/''F'' which contains all the roots of an irreducible polynomial if it contains one such root.568 bytes (88 words) - 17:21, 7 February 2009
- {{r|Polynomial ring}}626 bytes (79 words) - 16:01, 11 January 2010
- {{r|Polynomial}}564 bytes (72 words) - 16:08, 11 January 2010
- ...alled a polynomial ''in one variable''), whereas <math>x^2+y^2</math> is a polynomial in two variables, <math>x</math> and <math>y</math>. ...e usual addition and multiplication operations for polynomials, called a [[polynomial ring]].10 KB (1,741 words) - 10:04, 3 January 2009
- ...<math>A</math>, the object to consider would be the prime spectrum of a [[polynomial ring]] in sufficiently many variables modulo the ideal generated by the pol2 KB (338 words) - 10:01, 23 December 2008
- * [[Littlewood polynomial]]675 bytes (84 words) - 04:37, 14 September 2013
- {{r|Polynomial}}682 bytes (88 words) - 10:48, 4 October 2013
- {{r|Cyclotomic polynomial}}592 bytes (76 words) - 20:06, 11 January 2010
- {{r|Hermite polynomial}}721 bytes (92 words) - 17:54, 11 January 2010
- {{r|Minimal polynomial}}584 bytes (79 words) - 15:48, 11 January 2010
- {{r|Polynomial ring}}675 bytes (89 words) - 17:28, 11 January 2010
- {{r|Polynomial}}710 bytes (90 words) - 19:54, 11 January 2010
- {{r|Hermite polynomial}}704 bytes (87 words) - 17:05, 11 January 2010
- {{r|Artin-Schreier polynomial}}739 bytes (92 words) - 17:31, 11 January 2010
- {{r|Polynomial}}856 bytes (107 words) - 18:36, 11 January 2010
- {{r|Polynomial ring}}858 bytes (112 words) - 15:35, 11 January 2010
- ...s as close to the actual function as possible. This is typically done with polynomial or rational approximations. The second is obtaining approximate values of r985 bytes (130 words) - 01:40, 14 February 2010
- {{r|Polynomial}}837 bytes (109 words) - 16:27, 11 January 2010
- ...ction''' ''P''<sub>''ℓ''</sub><sup>''m''</sup> is related to a [[Legendre polynomial]] ''P''<sub>''ℓ''</sub> by the following equation ...s the factor (1−''x'' ² )<sup>½</sup> and hence is not a polynomial.7 KB (1,150 words) - 07:58, 24 January 2010
- {{r|Characteristic polynomial}}965 bytes (124 words) - 17:23, 11 January 2010
- {{r|Polynomial equation}}898 bytes (114 words) - 10:49, 11 January 2010
- {{r|Polynomial}}991 bytes (124 words) - 17:15, 11 January 2010
- {{r|Polynomial}}969 bytes (124 words) - 18:42, 11 January 2010
- ...derivative of the function being approximated when it is approximated by a polynomial of degree <math>n</math>. the Taylor series can be used to make the [[polynomial approximation]] of [[holomorphic function]]s, just truncating the series.5 KB (898 words) - 12:58, 11 June 2009
- ...ecifically [[algebra]], a '''quadratic equation''' is one involving only [[polynomial]]s of the second degree. Quadratic equations are a common part of mathemati However, one can algebraically manipulate polynomial equations in the usual way as long as the coefficients can be added and mu10 KB (1,580 words) - 08:52, 4 March 2009
- ...ath>w_i</math>, characterised in that, if the function <math>f</math> is [[polynomial]] of degree smaller than <math>2N</math>, then the exact equality takes pla The nodes <math>x_i</math> in equation (1) are zeros of the [[Legendre polynomial]] <math>P_N</math>:4 KB (630 words) - 12:32, 11 June 2009
- {{r|Polynomial}}1 KB (136 words) - 11:36, 11 January 2010
- {{r|Polynomial}}844 bytes (135 words) - 02:13, 15 December 2008
- {{r|Polynomial}}870 bytes (138 words) - 17:57, 21 December 2008
- {{r|polynomial}}864 bytes (139 words) - 14:58, 11 December 2008
- ...ultiple of another can also appear in other contexts. For instance, one [[polynomial]] can be a multiple of another. Please see the [[divisor (ring theory)|abs924 bytes (151 words) - 22:50, 31 March 2008
- {{r|Polynomial}}909 bytes (144 words) - 13:19, 21 December 2008
- {{r|Polynomial}}1 KB (146 words) - 16:32, 11 January 2010
- {{r|Polynomial}}990 bytes (154 words) - 13:18, 20 December 2008
- * The [[formal derivative]] makes the polynomial ring ''R''[''X''] over ''R'' a differential ring with949 bytes (151 words) - 11:31, 12 June 2009
- The following is a list of [[Hermite polynomial]]s ''H''<sub>''n''</sub>(''x'') through ''n'' = 12. The polynomials are sta891 bytes (128 words) - 08:50, 30 January 2009
- ...have dropped this requirement. An algebraic number must be a root of a [[polynomial]] with [[rational number|rational]] coefficients.1 KB (179 words) - 14:14, 10 December 2008
- ...[[Galois field]] '''GF'''(''2<sup>8</sup>''); multiply it by one constant polynomial modulo another3 KB (507 words) - 05:48, 8 April 2024
- ...ction|functions]] arising in the study of [[calculus]]. They include the [[polynomial|polynomials]], which are the object of study of [[elementary algebra]]. Mor ...th> times and then multiplied by the [[constant]] <math>a</math>. The '''[[polynomial|polynomials]]''' then are [[finite]] [[linear combination|linear combinatio8 KB (1,289 words) - 13:46, 26 May 2009
- {{r|Polynomial}}2 KB (260 words) - 08:13, 9 December 2009
- The '''NP complexity class''' (Non-deterministic [[Polynomial time]]) consists of all types of yes/no questions where whenever the polynomial in the length of the input. See technicalities section for formal definitio15 KB (2,548 words) - 21:03, 20 August 2010
- ...S'' integral over ''R'': that is, all elements of ''S'' satisfying a monic polynomial with coefficients in ''R''. The integral closure is a [[subring]] of ''S''1 KB (172 words) - 15:42, 7 February 2009
- * The [[minimal polynomial]] of ''A'' has no repeated roots;2 KB (230 words) - 02:39, 7 January 2009
- ==Chromatic polynomial== The '''chromatic polynomial''' counts the number of ways a graph can be coloured using no more than a g14 KB (2,315 words) - 00:35, 9 February 2010
- * The [[characteristic polynomial]] in [[linear algebra]].2 KB (242 words) - 02:01, 2 February 2009
- *<i>See [[Hermite polynomial/Addendum|Addendum]] for a table of Hermite polynomials through</i> ''n'' = ...://mathworld.wolfram.com/HermitePolynomial.html Eric W. Weisstein, Hermite Polynomial]4 KB (580 words) - 06:31, 31 May 2009
- ...atics)|ring]] of functions, which is the [[quotient ring|quotient]] of a [[polynomial ring]]. These algebraic properties can be defined in the context of arbitr4 KB (743 words) - 03:55, 14 February 2010
- ...ize the [[integer]]s. Other common examples of rings include the ring of [[polynomial]]s of one variable with real coefficients, or a ring of square [[matrix|mat *The set of [[polynomial|polynomials]] forms a commutative ring.10 KB (1,667 words) - 13:47, 5 June 2011