About the Project

permutations

AdvancedHelp

(0.001 seconds)

31—36 of 36 matching pages

31: Bibliography R
  • RISC Combinatorics Group (website) Research Institute for Symbolic Computation, Hagenberg im Mühlkreis, Austria.
  • 32: Bibliography C
  • B. C. Carlson (2011) Permutation symmetry for theta functions. J. Math. Anal. Appl. 378 (1), pp. 42–48.
  • Combinatorial Object Server (website) Department of Computer Science, University of Victoria, Canada.
  • 33: 19.36 Methods of Computation
    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 . …
    34: 20.7 Identities
    This reference also gives the eleven additional identities for the permutations of the four theta functions. …
    35: 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. …
    36: Bibliography B
  • J. Baik, P. Deift, and K. Johansson (1999) On the distribution of the length of the longest increasing subsequence of random permutations. J. Amer. Math. Soc. 12 (4), pp. 1119–1178.