# Search results

## Page title matches

• ...alled a polynomial ''in one variable''), whereas $x^2+y^2$ is a polynomial in two variables, $x$ and $y$. ...on]]s of the [[reactant]]s change. This variation is often specified by a polynomial whose variables are the concentrations.
8 KB (1,242 words) - 02:01, 10 November 2009
• ...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
• 34 bytes (3 words) - 13:06, 27 May 2008
• ...algebra]] the '''characteristic polynomial''' of a [[square matrix]] is a polynomial which has the [[eigenvalue]]s of the matrix as roots. Let ''A'' be an ''n''×''n'' matrix. The characteristic polynomial of ''A'' is the determinant
911 bytes (131 words) - 22:35, 17 February 2009
• ...ng (mathematics)|ring]] is a construction of a ring which formalises the [[polynomial]]s of [[elementary algebra]]. ==Construction of the polynomial ring==
4 KB (604 words) - 23:54, 20 February 2010
• ...N'' has type $\mu$. Hall showed that the functions ''g'' are [[polynomial]] functions of ''p'' with integer coefficients: these are the ''Hall polyno interpreted as the [[Hall-Littlewood polynomial]] functions. The theory of [[Schur function]]s
2 KB (264 words) - 22:53, 19 February 2010
• ...nomial|degree]] which that object satisfies. Examples include the minimal polynomial of a [[square matrix]], an [[endomorphism]] of a [[vector space]] or an [[a ...ver a field ''F''. We give ''A'' the structure of a [[module]] over the [[polynomial ring]] ''F''[''X''] by defining the action of $f(x) = \sum_{n=0}^d f_i 4 KB (613 words) - 02:34, 4 January 2013 • *<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 • In [[mathematics]], a '''Littlewood polynomial''' is a [[polynomial]] all of whose coefficients are +1 or &minus;1. '''Littlewood's problem''' asks how large the values of such a polynomial must be on the [[unit circle]] in the [[complex plane]]. The answer to thi 2 KB (230 words) - 16:13, 27 October 2008 • 153 bytes (21 words) - 13:19, 20 December 2008 • 34 bytes (3 words) - 05:56, 22 August 2007 • ...et of primitive [[root of unity|roots of unity]]. The ''n''-th cyclotomic polynomial, denoted by Φ<sub>''n''</sub> has [[integer]] cofficients. 1 KB (206 words) - 14:55, 11 December 2008 • #REDIRECT [[Polynomial#Degree]] 31 bytes (3 words) - 02:18, 22 December 2008 • 12 bytes (1 word) - 10:44, 13 November 2007 • ...alled a polynomial ''in one variable''), whereas [itex]x^2+y^2$ is a polynomial in two variables, $x$ and $y$. ...e usual addition and multiplication operations for polynomials, called a [[polynomial ring]].
10 KB (1,741 words) - 10:04, 3 January 2009
• The monic polynomial of least degree which a square matrix or endomorphism satisfies.
121 bytes (16 words) - 17:52, 11 December 2008
• The following is a list of [[Hermite polynomial]]s ''H''<sub>''n''</sub>(''x'') through ''n'' = 12. The polynomials are sta
891 bytes (128 words) - 08:50, 30 January 2009
• A polynomial all of whose coefficients are plus or minus 1.
95 bytes (13 words) - 16:16, 27 October 2008
• The polynomial attached to a square matrix or endomorphism det(A-XI)=0.
107 bytes (14 words) - 17:55, 11 December 2008
• 241 bytes (43 words) - 09:11, 30 January 2009

## Page text matches

• ...algebra]] the '''characteristic polynomial''' of a [[square matrix]] is a polynomial which has the [[eigenvalue]]s of the matrix as roots. Let ''A'' be an ''n''×''n'' matrix. The characteristic polynomial of ''A'' is the determinant
911 bytes (131 words) - 22:35, 17 February 2009
• Rewriting a quadratic polynomial as a constant multiple of a linear polynomial plus a constant.
131 bytes (18 words) - 08:44, 6 August 2008
• ...ed in nondeterministic polynomial time or, equivalently, can be checked in polynomial time.
171 bytes (23 words) - 09:22, 13 August 2010
• ...istic algorithm in polynomial time can also be solved deterministically in polynomial time.
246 bytes (34 words) - 07:09, 18 August 2010
• Auto-populated based on [[Special:WhatLinksHere/Polynomial]]. Needs checking by a human. {{r|Cyclotomic polynomial}}
2 KB (206 words) - 19:38, 11 January 2010
• ...nomial|degree]] which that object satisfies. Examples include the minimal polynomial of a [[square matrix]], an [[endomorphism]] of a [[vector space]] or an [[a ...ver a field ''F''. We give ''A'' the structure of a [[module]] over the [[polynomial ring]] ''F''[''X''] by defining the action of [itex]f(x) = \sum_{n=0}^d f_i
4 KB (613 words) - 02:34, 4 January 2013
• Auto-populated based on [[Special:WhatLinksHere/Hall polynomial]]. Needs checking by a human. {{r|Hall-Littlewood polynomial}}
464 bytes (58 words) - 17:04, 11 January 2010
• Auto-populated based on [[Special:WhatLinksHere/Littlewood polynomial]]. Needs checking by a human. {{r|Hall-Littlewood polynomial}}
470 bytes (58 words) - 18:08, 11 January 2010
• Auto-populated based on [[Special:WhatLinksHere/Hall-Littlewood polynomial]]. Needs checking by a human. {{r|Hall polynomial}}
475 bytes (59 words) - 17:03, 11 January 2010
• #REDIRECT [[polynomial]]
24 bytes (2 words) - 12:02, 1 April 2007
• #REDIRECT [[Polynomial#Degree]]
31 bytes (3 words) - 02:17, 22 December 2008
• #REDIRECT [[Polynomial#Degree]]
31 bytes (3 words) - 02:18, 22 December 2008
• #REDIRECT [[Polynomial#Degree]]
31 bytes (3 words) - 02:21, 22 December 2008
259 bytes (33 words) - 08:47, 6 August 2008
• Auto-populated based on [[Special:WhatLinksHere/Polynomial ring]]. Needs checking by a human. {{r|Minimal polynomial}}
770 bytes (96 words) - 19:39, 11 January 2010
• #REDIRECT [[Characteristic polynomial#Cayley-Hamilton theorem]]
63 bytes (5 words) - 17:05, 11 December 2008
• A set of polynomial equations with finitely many variables.
96 bytes (12 words) - 21:18, 4 September 2009
• A polynomial all of whose coefficients are plus or minus 1.
95 bytes (13 words) - 16:16, 27 October 2008
• In [[algebra]], the '''content''' of a [[polynomial]] is the [[highest common factor]] of its coefficients. A polynomial is ''[[Primitive polynomial|primitive]]'' if it has content unity.
971 bytes (132 words) - 15:00, 29 October 2008
• Weisstein, Eric W. "Legendre Polynomial." From MathWorld--A Wolfram Web Resource. [http://mathworld.wolfram.com/Leg
149 bytes (17 words) - 19:13, 1 September 2009

View (previous 20 | next 20) (20 | 50 | 100 | 250 | 500)