Polynomial sequence: Difference between revisions

Revision as of 14:14, 17 April 2010

Latest revision as of 15:36, 14 August 2021

(19 intermediate revisions by 16 users not shown)

Line 1:

{{UnreferencedUse American English|date =December 2009March 2019}}

{{Short description|Sequence valued in polynomials}}

{{Mergeto|polynomial|date=January 2008}}

In [[mathematics]], a '''polynomial sequence''' is a [[sequence]] of [[polynomial]]s indexed by the nonnegative integers[[integer]]s 0, 1, 2, 3, ..., in which each [[indexed family|index]] is equal to the [[degree of a polynomial|degree]] of the corresponding polynomial. Polynomial sequences are a topic of interest in [[enumerative combinatorics]] and [[algebraic combinatorics]], as well as [[applied mathematics]].

==Examples==

Line 9:

* [[Chebyshev polynomials]]

* [[Legendre polynomials]]

* [[BesselJacobi functionpolynomials]]s

OtherOthers come from [[statistics]]:

* [[Hermite polynomials]]

Many are studied in [[algebra]] and combinatorics:

* [[Monomial]]s

* [[Rising factorial]]s

* [[Falling factorial]]s

* [[All-one polynomial]]s

* [[Abel polynomials]]

* [[Bell polynomials]]

* [[Bernoulli polynomials]]

* [[Cyclotomic polynomial]]s

* [[Dickson polynomial]]s

* [[Fibonacci polynomials]]

* [[Lagrange polynomials]]

* [[Lucas polynomials]]

* [[Spread polynomials]]

Line 35 ⟶ 39:

* [[Generalized Appell polynomials]]

==See Alsoalso==

*[[Umbral calculus]]

== References==

* Aigner, Martin. "A course in enumeration", GTM Springer, 2007, ISBN {{isbn|3-540-39032-4}} p21.

* Roman, Steven "The Umbral Calculus", Dover Publications, 2005, ISBN {{isbn|978-0-486-4412944139-39}}.

* Williamson, S. Gill "Combinatorics for Computer Science", Dover Publications, (2002) p177.

Line 46 ⟶ 50:

[[Category:Polynomials]]

[[Category:Sequences and series]]

[[fr:Suite de polynômes]]

[[it:Sequenza polinomiale]]