Find link

language:

Find link is a tool written by Edward Betts.

searching for Polynomial sequence 20 found (48 total)

Orthogonal polynomials (2,079 words) [view diff] exact match in snippet view article find links to article

In mathematics, an orthogonal polynomial sequence is a family of polynomials such that any two different polynomials in the sequence are orthogonal to

Stirling polynomials (2,562 words) [view diff] exact match in snippet view article find links to article

Bernoulli polynomials. There are multiple variants of the Stirling polynomial sequence considered below most notably including the Sheffer sequence form

List of things named after Charles Hermite (405 words) [view diff] exact match in snippet view article find links to article

self-adjoint operator) Hermitian polynomials, a classical orthogonal polynomial sequence that arise in probability Hermitian symmetric space, a Kähler manifold

Gegenbauer polynomials (1,830 words) [view diff] exact match in snippet view article find links to article

Polynomial sequence

Classical orthogonal polynomials (6,139 words) [view diff] exact match in snippet view article find links to article

n − r. Then we have the following: (orthogonality) For fixed r, the polynomial sequence P[r] r, P[r] r + 1, P[r] r + 2, ... are orthogonal, weighted by W

Eulerian number (2,460 words) [view diff] exact match in snippet view article find links to article

Polynomial sequence

Gowers norm (1,077 words) [view diff] exact match in snippet view article find links to article

{\displaystyle \Vert f\Vert _{U^{d}[V]}\geq \delta } , there exists a polynomial sequence P : V → R / Z {\displaystyle P\colon V\to \mathbb {R} /\mathbb {Z}

Stirling numbers of the first kind (7,262 words) [view diff] exact match in snippet view article find links to article

Other software packages for guessing formulas for sequences (and polynomial sequence sums) involving Stirling numbers and other special triangles is available

Petkovšek's algorithm (1,431 words) [view diff] exact match in snippet view article find links to article

the original recurrence equation into a recurrence equation for a polynomial sequence c ( n ) {\textstyle c(n)} . The other polynomials a ( n ) , b ( n

Nilsequence (1,265 words) [view diff] exact match in snippet view article find links to article

integer variable, is a type of trigonometric polynomial, called a "polynomial sequence" for the purposes of the nilsequence theory. The generalisation to

Jacobi polynomials (2,449 words) [view diff] exact match in snippet view article find links to article

Polynomial sequence

Look-and-say sequence (1,629 words) [view diff] no match in snippet view article find links to article

Conway's constant is the unique positive real root of the following polynomial (sequence A137275 in the OEIS): + 1 x 71 − 1 x 69 − 2 x 68 − 1 x 67 + 2 x 66

Exponential integral (3,426 words) [view diff] exact match in snippet view article find links to article

Ramanujan–Soldner constant and ( P n ) {\displaystyle (P_{n})} is polynomial sequence defined by the following recurrence relation: P 0 ( x ) = x , P

Polynomial solutions of P-recursive equations (1,282 words) [view diff] exact match in snippet view article find links to article

right-hand side f ∈ K [ n ] {\textstyle f\in \mathbb {K} [n]} and unknown polynomial sequence y ( n ) ∈ K [ n ] {\displaystyle y(n)\in \mathbb {K} [n]} . Furthermore

Angelescu polynomials (1,248 words) [view diff] exact match in snippet view article find links to article

Polynomial sequence

Bernoulli polynomials of the second kind (1,942 words) [view diff] exact match in snippet view article find links to article

Polynomial sequence

Chebyshev polynomials (10,713 words) [view diff] exact match in snippet view article find links to article

Polynomial sequence

Faulhaber's formula (8,005 words) [view diff] exact match in snippet view article find links to article

Faulhaber polynomials is used by some authors to refer to another polynomial sequence related to that given above. Write a = ∑ k = 1 n k = n ( n + 1 )

Bell polynomials (7,714 words) [view diff] exact match in snippet view article find links to article

a_{n}x)=\sum _{k=1}^{n}B_{n,k}(a_{1},\dots ,a_{n-k+1})x^{k}.} Then this polynomial sequence is of binomial type, i.e. it satisfies the binomial identity p n

Logistic map (18,835 words) [view diff] no match in snippet view article find links to article

among four values. The latter number is a root of a 12th degree polynomial (sequence A086181 in the OEIS). With r increasing beyond 3.54409, from almost