About the Project

Bailey pairs

AdvancedHelp

(0.001 seconds)

31—40 of 96 matching pages

31: Bibliography
  • G. E. Andrews and A. Berkovich (1998) A trinomial analogue of Bailey’s lemma and N = 2 superconformal invariance. Comm. Math. Phys. 192 (2), pp. 245–260.
  • G. E. Andrews (2000) Umbral calculus, Bailey chains, and pentagonal number theorems. J. Combin. Theory Ser. A 91 (1-2), pp. 464–475.
  • G. E. Andrews (2001) Bailey’s Transform, Lemma, Chains and Tree. In Special Functions 2000: Current Perspective and Future Directions (Tempe, AZ), J. Bustoz, M. E. H. Ismail, and S. K. Suslov (Eds.), NATO Sci. Ser. II Math. Phys. Chem., Vol. 30, pp. 1–22.
  • 32: 1.13 Differential Equations
    Fundamental Pair
    Two solutions w 1 ( z ) and w 2 ( z ) are called a fundamental pair if any other solution w ( z ) is expressible as …A fundamental pair can be obtained, for example, by taking any z 0 D and requiring that … The following three statements are equivalent: w 1 ( z ) and w 2 ( z ) comprise a fundamental pair in D ; 𝒲 { w 1 ( z ) , w 2 ( z ) } does not vanish in D ; w 1 ( z ) and w 2 ( z ) are linearly independent, that is, the only constants A and B such that … If w 0 ( z ) is any one solution, and w 1 ( z ) , w 2 ( z ) are a fundamental pair of solutions of the corresponding homogeneous equation (1.13.1), then every solution of (1.13.8) can be expressed as …
    33: 15.11 Riemann’s Differential Equation
    Here { a 1 , a 2 } , { b 1 , b 2 } , { c 1 , c 2 } are the exponent pairs at the points α , β , γ , respectively. Cases in which there are fewer than three singularities are included automatically by allowing the choice { 0 , 1 } for exponent pairs. …
    34: 26.15 Permutations: Matrix Notation
    The inversion number of σ is a sum of products of pairs of entries in the matrix representation of σ : … N k ( B ) is the number of permutations in 𝔖 n for which exactly k of the pairs ( j , σ ( j ) ) are elements of B . …
    35: 36.7 Zeros
    Inside the cusp, that is, for x 2 < 8 | y | 3 / 27 , the zeros form pairs lying in curved rows. … Away from the z -axis and approaching the cusp lines (ribs) (36.4.11), the lattice becomes distorted and the rings are deformed, eventually joining to form “hairpins” whose arms become the pairs of zeros (36.7.1) of the cusp canonical integral. …
    36: 8.13 Zeros
    When x > x n a pair of conjugate trajectories emanate from the point a = a n in the complex a -plane. …
    37: 15.19 Methods of Computation
    This is because the linear transformations map the pair { e π i / 3 , e π i / 3 } onto itself. …
    38: 23.20 Mathematical Applications
    The two pairs of edges [ 0 , ω 1 ] [ ω 1 , 2 ω 3 ] and [ 2 ω 3 , 2 ω 3 ω 1 ] [ 2 ω 3 ω 1 , 0 ] of R are each mapped strictly monotonically by onto the real line, with 0 , ω 1 e 1 , 2 ω 3 ; similarly for the other pair of edges. For each pair of edges there is a unique point z 0 such that ( z 0 ) = 0 . …
    39: 2.7 Differential Equations
    One pair of independent solutions of the equation …In theory either pair may be used to construct any other solution …This kind of cancellation cannot take place with w 1 ( z ) and w 2 ( z ) , and for this reason, and following Miller (1950), we call w 1 ( z ) and w 2 ( z ) a numerically satisfactory pair of solutions. … This is characteristic of numerically satisfactory pairs. … In oscillatory intervals, and again following Miller (1950), we call a pair of solutions numerically satisfactory if asymptotically they have the same amplitude and are 1 2 π out of phase.
    40: 12.2 Differential Equations
    For real values of z ( = x ) , numerically satisfactory pairs of solutions (§2.7(iv)) of (12.2.2) are U ( a , x ) and V ( a , x ) when x is positive, or U ( a , x ) and V ( a , x ) when x is negative. For (12.2.3) W ( a , x ) and W ( a , x ) comprise a numerically satisfactory pair, for all x . … In , for j = 0 , 1 , 2 , 3 , U ( ( 1 ) j 1 a , ( i ) j 1 z ) and U ( ( 1 ) j a , ( i ) j z ) comprise a numerically satisfactory pair of solutions in the half-plane 1 4 ( 2 j 3 ) π ph z 1 4 ( 2 j + 1 ) π . …