About the Project

relation to permutations

AdvancedHelp

(0.002 seconds)

11—17 of 17 matching pages

11: Bibliography C
  • F. Calogero (1978) Asymptotic behaviour of the zeros of the (generalized) Laguerre polynomial L n α ( x )  as the index α  and limiting formula relating Laguerre polynomials of large index and large argument to Hermite polynomials. Lett. Nuovo Cimento (2) 23 (3), pp. 101–102.
  • B. C. Carlson (2006b) Table of integrals of squared Jacobian elliptic functions and reductions of related hypergeometric R -functions. Math. Comp. 75 (255), pp. 1309–1318.
  • B. C. Carlson (2011) Permutation symmetry for theta functions. J. Math. Anal. Appl. 378 (1), pp. 42–48.
  • W. J. Cody (1991) Performance evaluation of programs related to the real gamma function. ACM Trans. Math. Software 17 (1), pp. 46–54.
  • Combinatorial Object Server (website) Department of Computer Science, University of Victoria, Canada.
  • 12: 26.4 Lattice Paths: Multinomial Coefficients and Set Partitions
    §26.4(i) Definitions
    For k = 0 , 1 , the multinomial coefficient is defined to be 1 . … M 2 is the number of permutations of { 1 , 2 , , n } with a 1 cycles of length 1, a 2 cycles of length 2, , and a n cycles of length n : …(The empty set is considered to have one permutation consisting of no cycles.) …
    §26.4(iii) Recurrence Relation
    13: 19.14 Reduction of General Elliptic Integrals
    In (19.14.1)–(19.14.3) both the integrand and cos ϕ are assumed to be nonnegative. …In (19.14.4) 0 y < x , each quadratic polynomial is positive on the interval ( y , x ) , and α , β , γ is a permutation of 0 , a 1 b 2 , a 2 b 1 (not all 0 by assumption) such that α β γ . … The last reference gives a clear summary of the various steps involving linear fractional transformations, partial-fraction decomposition, and recurrence relations. It then improves the classical method by first applying Hermite reduction to (19.2.3) to arrive at integrands without multiple poles and uses implicit full partial-fraction decomposition and implicit root finding to minimize computing with algebraic extensions. …
    14: Bibliography R
  • E. M. Rains (1998) Normal limit theorems for symmetric random matrices. Probab. Theory Related Fields 112 (3), pp. 411–423.
  • RISC Combinatorics Group (website) Research Institute for Symbolic Computation, Hagenberg im Mühlkreis, Austria.
  • R. R. Rosales (1978) The similarity solution for the Korteweg-de Vries equation and the related Painlevé transcendent. Proc. Roy. Soc. London Ser. A 361, pp. 265–275.
  • R. Roy (2017) Elliptic and modular functions from Gauss to Dedekind to Hecke. Cambridge University Press, Cambridge.
  • J. Rushchitsky and S. Rushchitska (2000) On Simple Waves with Profiles in the form of some Special Functions—Chebyshev-Hermite, Mathieu, Whittaker—in Two-phase Media. In Differential Operators and Related Topics, Vol. I (Odessa, 1997), Operator Theory: Advances and Applications, Vol. 117, pp. 313–322.
  • 15: 19.36 Methods of Computation
    Legendre’s integrals can be computed from symmetric integrals by using the relations in §19.25(i). … As n , c n , a n , and t n converge quadratically to limits 0 , M , and T , respectively; hence … If x , y , and z are permuted so that 0 x < y < z , then the computation of R F ( x , y , z ) is fastest if we make c 0 2 a 0 2 / 2 by choosing θ = 1 when y < ( x + z ) / 2 or θ = 1 when y ( x + z ) / 2 . … To (19.36.6) add … Quadratic transformations can be applied to compute Bulirsch’s integrals (§19.2(iii)). …
    16: 34.3 Basic Properties: 3 j Symbol
    Even permutations of columns of a 3 j symbol leave it unchanged; odd permutations of columns produce a phase factor ( 1 ) j 1 + j 2 + j 3 , for example, …
    §34.3(iii) Recursion Relations
    §34.3(vii) Relations to Legendre Polynomials and Spherical Harmonics
    Equations (34.3.19)–(34.3.22) are particular cases of more general results that relate rotation matrices to 3 j symbols, for which see Edmonds (1974, Chapter 4). …
    17: 26.8 Set Partitions: Stirling Numbers
    s ( n , k ) denotes the Stirling number of the first kind: ( 1 ) n k times the number of permutations of { 1 , 2 , , n } with exactly k cycles. …
    26.8.7 k = 0 n s ( n , k ) x k = ( x n + 1 ) n ,
    §26.8(iv) Recurrence Relations
    §26.8(vi) Relations to Bernoulli Numbers
    For asymptotic approximations for s ( n + 1 , k + 1 ) and S ( n , k ) that apply uniformly for 1 k n as n see Temme (1993) and Temme (2015, Chapter 34). …