Search results
Jump to navigation
Jump to search
- {{About|addition theorems in general|specific addition theorems for trigonometric functions|angle addition formulas}} ...of the addition theorem for [[elliptic function]]s. To "classify" addition theorems it is necessary to put some restriction on the type of function ''G'' admit ...3 KB (434 words) - 01:33, 30 November 2022
- An interval polynomial is the family of all polynomials ...of the family are stable) if and only if the four so-called '''Kharitonov polynomials''' ...3 KB (449 words) - 02:08, 15 November 2024
- ...rix), a tridiagonal symmetric matrix appearing in the theory of orthogonal polynomials * [[Jacobi polynomials]], a class of orthogonal polynomials ...2 KB (247 words) - 10:15, 21 December 2024
- ...matics]], the '''Brauer–Nesbitt theorem''' can refer to several different theorems proved by [[Richard Brauer]] and [[Cecil J. Nesbitt]] in the [[representati .../math> or <math>char(E)>n</math>, then the condition on the characteristic polynomials can be changed to the condition that Tr<math>\rho_1(g)</math>=Tr<math>\rho_ ...2 KB (397 words) - 15:35, 1 March 2023
- '''Chebyshev's theorem''' is any of several theorems proven by Russian mathematician [[Pafnuty Chebyshev]]. * [[Chebyshev's sum inequality]], about sums and products of decreasing sequences ...734 bytes (102 words) - 01:03, 2 April 2023
- ...d Wright}}</ref> Some of these are [[Classification theorem|classification theorems]] of objects which are mainly dealt with in the field. For instance, the [[ ==Fundamental theorems of mathematical topics== ...5 KB (578 words) - 13:53, 14 September 2024
- {{for|Lagrange's other theorems|Lagrange's theorem (disambiguation)}} ...Prime number|prime]] ''p''. More precisely, it states that for all integer polynomials <math>\textstyle f \in \mathbb{Z}[x]</math>, either: ...4 KB (666 words) - 21:50, 16 April 2025
- ..._1,\ldots,X_n)</math> and <math>g(X_2, \ldots,X_n)</math> are multivariate polynomials and <math>g</math> is independent of <math>X_1</math>, then <math>X_1 - g(X ==Factorization of polynomials== ...7 KB (1,222 words) - 11:58, 17 March 2025
- '''Mergelyan's theorem''' is a result from approximation by polynomials in [[complex analysis]] proved by the [[Armenian SSR|Armenian]] [[mathemat | title = Mergelyan's and Arakelian's theorems for manifold-valued maps ...4 KB (588 words) - 01:42, 22 January 2025
- == Statement of the theorems == ...math>\{f_j\}_{j=1}^r\subseteq\mathbb{F}[X_1,\ldots,X_n]</math> be a set of polynomials such that the number of variables satisfies ...7 KB (1,019 words) - 14:15, 25 April 2024
- {{short description|Result in number theory, concerning irreducible polynomials}} ...of a proper subset of the variables to rational numbers such that all the polynomials remain irreducible. This theorem is a prominent theorem in number theory. ...4 KB (707 words) - 11:42, 20 August 2021
- ...lynomials with this property are called [[stable polynomial|Hurwitz stable polynomials]]. The Routh–Hurwitz theorem is important in [[dynamical system]]s and [[c ...inary unit]] and {{math|''c''}} is a [[real number]]). Let us define real polynomials {{math|''P''<sub>0</sub>(''y'')}} and {{math|''P''<sub>1</sub>(''y'')}} by ...6 KB (817 words) - 14:48, 26 May 2025
- {{Short description|Sequence of polynomials}} ...polynomials Q<sub>n</sub> occasionally called Touchard polynomials|Bateman polynomials}} ...7 KB (1,080 words) - 14:10, 12 March 2025
- ...2/pdf12-1/uproots.pdf}}</ref> is an application of [[Euclidean division of polynomials]]. It states that, for every number <math>r</math>, any [[polynomial]] <mat ...[[Euclidean division of polynomials|Euclidean division]], which, given two polynomials {{math|''f''(''x'')}} (the dividend) and {{math|''g''(''x'')}} (the divisor ...4 KB (708 words) - 14:02, 10 May 2025
- ...e unfactorable into the product of lower-[[degree of a polynomial|degree]] polynomials with [[integer]] [[coefficient]]s. ...last1=Pólya |first1=George |last2=Szegő |first2=Gábor |title=Problems and theorems in analysis, volume 2 |publisher=Springer |year=2004 |volume=2 |isbn=978-3- ...5 KB (754 words) - 07:34, 5 April 2025
- ...e journal |first=Richard P. |last=Stanley |title=Combinatorial reciprocity theorems |journal=[[Advances in Mathematics]] |volume=14 |issue=2 |pages=194–253 |ye ...eciprocity theorem generalizes Ehrhart-Macdonald reciprocity for [[Ehrhart polynomials]] of rational [[Convex polytope|convex polytopes]]. ...2 KB (348 words) - 07:37, 8 July 2024
- * Any of a number of [[fundamental theorems]] identified in mathematics, such as: ...Fundamental theorem of algebra]], a theorem regarding the factorization of polynomials ...2 KB (225 words) - 22:32, 4 February 2024
- ...us theorem) and the [[syzygy theorem]] (theorem on relations). These three theorems were the starting point of the interpretation of [[algebraic geometry]] in ...] is the set of the common [[root of a polynomial|zeros]] of finitely many polynomials. ...11 KB (1,793 words) - 10:59, 15 November 2025
- * [[Reciprocity (electromagnetism)]], theorems relating sources and the resulting fields in classical electromagnetism ** [[Cubic reciprocity]], theorems that state conditions under which the congruence {{nowrap|''x''<sup>3</sup> ...5 KB (658 words) - 21:54, 20 January 2025
- The [[Legendre polynomials]] <math>P_n(x)</math> are solutions to the [[Sturm–Liouville theory|Sturm–L ...s (known in this case as a Fourier–Legendre series) involving the Legendre polynomials, so that ...9 KB (1,332 words) - 15:40, 25 February 2025