Search results
Jump to navigation
Jump to search
Page title matches
- ...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>. ...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
- ...s method). Only after all this would we introduce a formal definition of a polynomial as an infinite sequence with finite support over a ring. (Zuh? they would r ..., as well as the word ''ring'' and the discrepancy between polynomials and polynomial functions to the advanced page.9 KB (1,496 words) - 16:44, 24 December 2008
- ...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 <math>f(x) = \sum_{n=0}^d f_i4 KB (613 words) - 02:34, 4 January 2013
- 34 bytes (3 words) - 13:06, 27 May 2008
- ...N'' has type <math>\mu</math>. 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]]s2 KB (264 words) - 22:53, 19 February 2010
- 12 bytes (1 word) - 14:57, 22 December 2008
- 12 bytes (1 word) - 22:35, 17 February 2009
- 275 bytes (37 words) - 13:47, 8 March 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
- 12 bytes (1 word) - 13:04, 8 March 2009
- 153 bytes (21 words) - 13:19, 20 December 2008
- In [[mathematics]], a '''Littlewood polynomial''' is a [[polynomial]] all of whose coefficients are +1 or −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 thi2 KB (230 words) - 16:13, 27 October 2008
- ...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
- *<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
- ...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
- 92 bytes (9 words) - 16:15, 27 October 2008
- 12 bytes (1 word) - 04:00, 30 January 2009
- 34 bytes (3 words) - 05:56, 22 August 2007
- 12 bytes (1 word) - 14:57, 11 December 2008
- | pagename = Polynomial | abc = Polynomial733 bytes (69 words) - 06:08, 15 March 2024
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 determinant911 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
- == "A quasi-polynomial algorithm for discrete logarithm ..." ==369 bytes (54 words) - 22:39, 23 March 2014
- ...istic algorithm in polynomial time can also be solved deterministically in polynomial time.245 bytes (34 words) - 16:08, 27 July 2023
- 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 <math>f(x) = \sum_{n=0}^d f_i4 KB (613 words) - 02:34, 4 January 2013
- 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 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/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
- {{r|Polynomial}} {{r|Quadratic polynomial}}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
- | pagename = Polynomial ring | abc = polynomial ring733 bytes (62 words) - 13:05, 8 March 2009
- | pagename = Hall polynomial | abc = Hall polynomial735 bytes (62 words) - 13:46, 8 March 2009
- #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