About the Project

bign官网,bign平台大全,bign平台直营网站,bign集团官方网站,【bign官网∶33kk66.com】bign平台大全,bign直营平台,bign宝盈集团官网,bign论坛,bign博彩平台,博彩网址【复制打开∶33kk66.com】

AdvancedHelp

The term"kk66.com" was not found.Possible alternative term: "gcn.com".

(0.002 seconds)

1—10 of 119 matching pages

1: 18.40 Methods of Computation
Results of low ( 2 to 3 decimal digits) precision for w ( x ) are easily obtained for N 10 to 20 . … Convergence is O ( N 2 ) . … Here x ( t , N ) is an interpolation of the abscissas x i , N , i = 1 , 2 , , N , that is, x ( i , N ) = x i , N , allowing differentiation by i . …where the coefficients are defined recursively via a 1 = x 1 , N x 2 , N 1 , and …The PWCF x ( t , N ) is a minimally oscillatory algebraic interpolation of the abscissas x i , N , i = 1 , 2 , , N . …
2: 31.14 General Fuchsian Equation
The general second-order Fuchsian equation with N + 1 regular singularities at z = a j , j = 1 , 2 , , N , and at , is given by …
α β = j = 1 N a j q j .
The three sets of parameters comprise the singularity parameters a j , the exponent parameters α , β , γ j , and the N 2 free accessory parameters q j . With a 1 = 0 and a 2 = 1 the total number of free parameters is 3 N 3 . Heun’s equation (31.2.1) corresponds to N = 3 . …
3: 19.19 Taylor and Related Series
For N = 0 , 1 , 2 , define the homogeneous hypergeometric polynomial …where the summation extends over all nonnegative integers m 1 , , m n whose sum is N . … This form of T N can be applied to (19.16.14)–(19.16.18) and (19.16.20)–(19.16.23) if we use …Then T N has at most one term if N 5 in the series for R F . For R J and R D , T N has at most one term if N 3 , and two terms if N = 4 or 5. …
4: 32.14 Combinatorics
Let S N be the group of permutations 𝝅 of the numbers 1 , 2 , , N 26.2). With 1 m 1 < < m n N , 𝝅 ( m 1 ) , 𝝅 ( m 2 ) , , 𝝅 ( m n ) is said to be an increasing subsequence of 𝝅 of length n when 𝝅 ( m 1 ) < 𝝅 ( m 2 ) < < 𝝅 ( m n ) . Let N ( 𝝅 ) be the length of the longest increasing subsequence of 𝝅 . …
32.14.1 lim N Prob ( N ( 𝝅 ) 2 N N 1 / 6 s ) = F ( s ) ,
5: 26.17 The Twelvefold Way
The twelvefold way gives the number of mappings f from set N of n objects to set K of k objects (putting balls from set N into boxes in set K ). … Table 26.17.1 is reproduced (in modified form) from Stanley (1997, p. 33). …
Table 26.17.1: The twelvefold way.
elements of N elements of K f unrestricted f one-to-one f onto
6: 31.15 Stieltjes Polynomials
where Φ ( z ) is a polynomial of degree not exceeding N 2 . There exist at most ( n + N 2 N 2 ) polynomials V ( z ) of degree not exceeding N 2 such that for Φ ( z ) = V ( z ) , (31.15.1) has a polynomial solution w = S ( z ) of degree n . … then there are exactly ( n + N 2 N 2 ) polynomials S ( z ) , each of which corresponds to each of the ( n + N 2 N 2 ) ways of distributing its n zeros among N 1 intervals ( a j , a j + 1 ) , j = 1 , 2 , , N 1 . … If the exponent and singularity parameters satisfy (31.15.5)–(31.15.6), then for every multi-index 𝐦 = ( m 1 , m 2 , , m N 1 ) , where each m j is a nonnegative integer, there is a unique Stieltjes polynomial with m j zeros in the open interval ( a j , a j + 1 ) for each j = 1 , 2 , , N 1 . … Let S 𝐦 ( z ) and S 𝐥 ( z ) be Stieltjes polynomials corresponding to two distinct multi-indices 𝐦 = ( m 1 , m 2 , , m N 1 ) and 𝐥 = ( 1 , 2 , , N 1 ) . …
7: 18.25 Wilson Class: Definitions
For the Wilson class OP’s p n ( x ) with x = λ ( y ) : if the y -orthogonality set is { 0 , 1 , , N } , then the role of the differentiation operator d / d x in the Jacobi, Laguerre, and Hermite cases is played by the operator Δ y followed by division by Δ y ( λ ( y ) ) , or by the operator y followed by division by y ( λ ( y ) ) . … Table 18.25.1 lists the transformations of variable, orthogonality ranges, and parameter constraints that are needed in §18.2(i) for the Wilson polynomials W n ( x ; a , b , c , d ) , continuous dual Hahn polynomials S n ( x ; a , b , c ) , Racah polynomials R n ( x ; α , β , γ , δ ) , and dual Hahn polynomials R n ( x ; γ , δ , N ) . … If α + 1 = N , then the weights will be positive iff one of the following eight sets of inequalities holds: …
N 1 < N + γ < β < N δ .
The first four sets imply γ + δ > 2 , and the last four imply γ + δ < 2 N . …
8: 3.6 Linear Difference Equations
Stability can be restored, however, by backward recursion, provided that c n 0 , n : starting from w N and w N + 1 , with N large, equation (3.6.3) is applied to generate in succession w N 1 , w N 2 , , w 0 . … Here N is an arbitrary positive integer. … starting with w N = 0 . … The least value of N that satisfies (3.6.9) is found to be 16. …
9: 18.23 Hahn Class: Generating Functions
18.23.1 F 1 1 ( x α + 1 ; z ) F 1 1 ( x N β + 1 ; z ) = n = 0 N ( N ) n ( β + 1 ) n n ! Q n ( x ; α , β , N ) z n , x = 0 , 1 , , N .
18.23.3 ( 1 1 p p z ) x ( 1 + z ) N x = n = 0 N ( N n ) K n ( x ; p , N ) z n , x = 0 , 1 , , N .
10: 18.26 Wilson Class: Continued
Here we use as convention for (16.2.1) with b q = N , a 1 = n , and n = 0 , 1 , , N that the summation on the right-hand side ends at k = n . …
18.26.11 lim t R n ( x ( x + t + 1 ) ; p t , ( 1 p ) t , N ) = K n ( x ; p , N ) .
18.26.12 r ( x ; β , c , N ) = x ( x + β + c 1 ( 1 c ) N ) ,
18.26.13 lim N R n ( r ( x ; β , c , N ) ; β 1 , c 1 ( 1 c ) N , N ) = M n ( x ; β , c ) .
18.26.21 ( 1 z ) y F 1 2 ( y N , y + γ + 1 δ N ; z ) = n = 0 N ( γ + 1 ) n ( N ) n ( δ N ) n n ! R n ( y ( y + γ + δ + 1 ) ; γ , δ , N ) z n .