About the Project

integer degree and order

AdvancedHelp

(0.003 seconds)

11—20 of 50 matching pages

11: 31.8 Solutions via Quadratures
For half-odd-integer values of the exponent parameters: … Here Ψ g , N ( λ , z ) is a polynomial of degree g in λ and of degree N = m 0 + m 1 + m 2 + m 3 in z , that is a solution of the third-order differential equation satisfied by a product of any two solutions of Heun’s equation. The degree g is given by … By automorphisms from §31.2(v), similar solutions also exist for m 0 , m 1 , m 2 , m 3 , and Ψ g , N ( λ , z ) may become a rational function in z . …The curve Γ reflects the finite-gap property of Equation (31.2.1) when the exponent parameters satisfy (31.8.1) for m j . …
12: 14.24 Analytic Continuation
14.24.1 P ν μ ( z e s π i ) = e s ν π i P ν μ ( z ) + 2 i sin ( ( ν + 1 2 ) s π ) e s π i / 2 cos ( ν π ) Γ ( μ ν ) 𝑸 ν μ ( z ) ,
14.24.2 𝑸 ν μ ( z e s π i ) = ( 1 ) s e s ν π i 𝑸 ν μ ( z ) ,
14.24.4 𝑸 ν , s μ ( z ) = e s μ π i 𝑸 ν μ ( z ) π i sin ( s μ π ) sin ( μ π ) Γ ( ν μ + 1 ) P ν μ ( z ) ,
13: 14.18 Sums
14.18.9 𝖯 ν μ ( x ) = sin ( ν π ) π n = 0 ( 1 ) n 2 n + 1 ( ν n ) ( ν + n + 1 ) 𝖯 n μ ( x ) , 1 < x 1 , μ 0 , ν .
14: 14.1 Special Notation
x , y , τ real variables.
m , n unless stated otherwise, nonnegative integers, used for order and degree, respectively.
15: 18.2 General Orthogonal Polynomials
If the polynomials p n ( x ) ( n = 0 , 1 , , N ) are orthogonal on a finite set X of N + 1 distinct points as in (18.2.3), then the polynomial p N + 1 ( x ) of degree N + 1 , up to a constant factor defined by (18.2.8) or (18.2.10), vanishes on X . … The Hankel determinant Δ n of order n is defined by Δ 0 = 1 and …
Degree lowering and raising differentiation formulas and structure relations
If A n ( x ) and B n ( x ) are polynomials of degree independent of n , and moreover π n ( x ) is a polynomial π ( x ) independent of n then … Polynomials p n ( x ) of degree n ( n = 0 , 1 , 2 , ) are called Sheffer polynomials if they are generated by a generating function of the form …
16: 14.9 Connection Formulas
14.9.6 π cos ( ν π ) cos ( μ π ) 𝖯 ν μ ( x ) = sin ( ( ν + μ ) π ) 𝖰 ν μ ( x ) sin ( ( ν μ ) π ) 𝖰 ν 1 μ ( x ) .
14.9.8 1 2 π sin ( ( ν μ ) π ) 𝖯 ν μ ( x ) = cos ( ( ν μ ) π ) 𝖰 ν μ ( x ) 𝖰 ν μ ( x ) ,
14.9.14 𝑸 ν μ ( x ) = 𝑸 ν μ ( x ) ,
14.9.16 𝑸 ν μ ( x ) = ( 1 2 π ) 1 / 2 ( x 2 1 ) 1 / 4 P μ ( 1 / 2 ) ν ( 1 / 2 ) ( x ( x 2 1 ) 1 / 2 ) .
14.9.17 P ν μ ( x ) = ( 2 / π ) 1 / 2 ( x 2 1 ) 1 / 4 𝑸 μ ( 1 / 2 ) ν + ( 1 / 2 ) ( x ( x 2 1 ) 1 / 2 ) .
17: 1.2 Elementary Algebra
Let α 1 , α 2 , , α n be distinct constants, and f ( x ) be a polynomial of degree less than n . … If m 1 , m 2 , , m n are positive integers and deg f < j = 1 n m j , then there exist polynomials f j ( x ) , deg f j < m j , such that … Square n × n matrices (said to be of order n ) dominate the use of matrices in the DLMF, and they have many special properties. Unless otherwise indicated, matrices are assumed square, of order n ; and, when vectors are combined with them, these are of length n . … The norm of an order n square matrix, 𝐀 , is …
18: 14.3 Definitions and Hypergeometric Representations
When μ = m ( ) (14.3.2) is replaced by its limiting value; see Hobson (1931, §132) for details. …
14.3.11 𝖯 ν μ ( x ) = cos ( 1 2 ( ν + μ ) π ) w 1 ( ν , μ , x ) + sin ( 1 2 ( ν + μ ) π ) w 2 ( ν , μ , x ) ,
14.3.15 P ν μ ( x ) = 2 μ ( x 2 1 ) μ / 2 𝐅 ( μ ν , ν + μ + 1 ; μ + 1 ; 1 2 1 2 x ) ,
19: 14.8 Behavior at Singularities
14.8.1 𝖯 ν μ ( x ) 1 Γ ( 1 μ ) ( 2 1 x ) μ / 2 , μ 1 , 2 , 3 , ,
14.8.4 𝖰 ν μ ( x ) 1 2 cos ( μ π ) Γ ( μ ) ( 2 1 x ) μ / 2 , μ 1 2 , 3 2 , 5 2 , ,
14.8.7 P ν μ ( x ) 1 Γ ( 1 μ ) ( 2 x 1 ) μ / 2 , μ 1 , 2 , 3 , ,
14.8.11 𝑸 ν μ ( x ) Γ ( μ ) 2 Γ ( ν + μ + 1 ) ( 2 x 1 ) μ / 2 , μ > 0 , ν + μ 1 , 2 , 3 , .
14.8.15 𝑸 ν μ ( x ) π 1 / 2 Γ ( ν + 3 2 ) ( 2 x ) ν + 1 , ν 3 2 , 5 2 , 7 2 , ,
20: 18.30 Associated OP’s
The constant c is usually taken as a positive integer. However, if the recurrence coefficients are polynomial, or rational, functions of n , polynomials of degree n may be well defined for c provided that A n + c B n + c 0 , n = 0 , 1 , Askey and Wimp (1984). The order c recurrence is initialized as …The lowest order monic versions of both of these appear in §18.2(x), (18.2.31) defining the c = 1 associated monic polynomials, and (18.2.32) their closely related cousins the c = 0 corecursive polynomials. … The zeroth order corecursive monic polynomials p ^ n ( 0 ) ( x ) follow directly from the alternate initialization …