Content deleted Content added
→Examples: A Bessel function is not a polynomial |
Joel Brennan (talk | contribs) m added and removed wikilinks |
||
(10 intermediate revisions by 9 users not shown) | |||
Line 1:
{{Use American English|date = March 2019}}
In [[mathematics]], a '''polynomial sequence''' is a [[sequence]] of [[polynomial]]s indexed by the nonnegative integers 0, 1, 2, 3, ..., in which each index is [[equal]] to the degree of the corresponding polynomial. Polynomial sequences are a topic of interest in [[enumerative combinatorics]] and [[algebraic combinatorics]], as well as [[applied mathematics]].▼
{{Short description|Sequence valued in polynomials}}
▲In [[mathematics]], a '''polynomial sequence''' is a [[sequence]] of [[polynomial]]s indexed by the nonnegative
==Examples==
Line 12 ⟶ 14:
* [[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]]
Line 38 ⟶ 42:
*[[Umbral calculus]]
==
* Aigner, Martin. "A course in enumeration", GTM Springer, 2007,
* Roman, Steven "The Umbral Calculus", Dover Publications, 2005,
* Williamson, S. Gill "Combinatorics for Computer Science", Dover Publications, (2002) p177.
Line 46 ⟶ 50:
[[Category:Polynomials]]
[[Category:Sequences and series]]
|