Polynomial sequence: Difference between revisions

Revision as of 00:55, 7 March 2013

Latest revision as of 15:36, 14 August 2021

(8 intermediate revisions by 7 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 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 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 39 ⟶ 43:

==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-3{{Please check ISBN|reason=Check digit (3) does not correspond to calculated figure.9}}.

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