Search results
Jump to navigation
Jump to search
Page title matches
- 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
- A polynomial all of whose coefficients are plus or minus 1.95 bytes (13 words) - 16:16, 27 October 2008
- | pagename = Cyclotomic polynomial | abc = Cyclotomic polynomial2 KB (229 words) - 14:57, 11 December 2008
- An equation in which a polynomial in one or more variables is set equal to zero.117 bytes (19 words) - 10:56, 4 September 2009
- * [[Littlewood polynomial]]675 bytes (84 words) - 04:37, 14 September 2013
- 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
- Auto-populated based on [[Special:WhatLinksHere/Polynomial]]. Needs checking by a human. {{r|Cyclotomic polynomial}}2 KB (206 words) - 19:38, 11 January 2010
- 136 bytes (20 words) - 10:57, 4 September 2009
- 241 bytes (43 words) - 09:11, 30 January 2009
- 151 bytes (17 words) - 02:37, 4 January 2013
- 92 bytes (9 words) - 17:24, 27 October 2008
- 33 bytes (3 words) - 09:44, 27 May 2008
- | pagename = minimal polynomial | abc = minimal polynomial2 KB (226 words) - 09:29, 15 March 2024
- | pagename = polynomial equation | abc = polynomial equation2 KB (229 words) - 15:44, 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 form2 KB (295 words) - 15:43, 7 December 2008
- | pagename = Characteristic polynomial | abc = polynomial, Characteristic2 KB (227 words) - 07:20, 15 March 2024
Page text matches
- | pagename = Polynomial | abc = Polynomial733 bytes (69 words) - 06:08, 15 March 2024
- 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/Leg149 bytes (17 words) - 19:13, 1 September 2009
- ''a'' such that the [[ring of integers]] ''O''<sub>''K''</sub> is a polynomial ring '''Z'''[''a'']. The powers of such a element ''a'' constitute a '''po ...lynomial|discriminant]] of the [[Minimal polynomial (field theory)|minimal polynomial]] of α.1 KB (208 words) - 16:47, 17 December 2008
- ...ant of a polynomial''' is an invariant which determines whether or not a [[polynomial]] has repeated roots. Given a polynomial1 KB (163 words) - 18:01, 21 December 2008
- The monic polynomial of least degree which a square matrix or endomorphism satisfies.121 bytes (16 words) - 17:52, 11 December 2008
- | pagename = Discriminant of a polynomial | abc = Discriminant of a polynomial838 bytes (69 words) - 12:12, 16 October 2010
- Polynomial sequence which can be considered as a generalisation of the Fibonacci numbe126 bytes (16 words) - 07:19, 4 September 2009
- An element of a field extension for which the minimal polynomial has distinct roots.120 bytes (17 words) - 04:11, 20 December 2008
- {{r|Cyclotomic polynomial}} {{r|Discriminant of a polynomial}}2 KB (247 words) - 06:00, 7 November 2010
- A field extension which contains all the roots of an irreducible polynomial if it contains one such root.141 bytes (21 words) - 13:16, 21 December 2008
- A polynomial whose roots are primitive roots of unity.90 bytes (12 words) - 16:50, 8 December 2008
- *{{MathWorld |title=Hall-Littlewood Polynomial |urlname=Hall-LittlewoodPolynomial}}97 bytes (7 words) - 04:38, 14 September 2013
- ...e coefficients are [[integer]]s, or, equivalently, it is not a root of any polynomial whose coefficients are [[rational number|rational]]. ...</math> is irrational. However it is algebraic, since it is a root of the polynomial <math> x^2-2 </math>. It is thus irrational but not transcendental.875 bytes (130 words) - 12:27, 8 May 2008
- A field extension generated by the roots of a polynomial.93 bytes (13 words) - 13:13, 21 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
- An algebraic number field for which the ring of integers is a polynomial ring.114 bytes (17 words) - 17:08, 28 October 2008
- An equation in which a polynomial in one or more variables is set equal to zero.117 bytes (19 words) - 10:56, 4 September 2009
- The polynomial attached to a square matrix or endomorphism det(A-XI)=0.107 bytes (14 words) - 17:55, 11 December 2008