About the Project

q-binomial%20coefficient

AdvancedHelp

(0.002 seconds)

3 matching pages

1: 26.10 Integer Partitions: Other Restrictions
Throughout this subsection it is assumed that | q | < 1 .
26.10.2 n = 0 p ( 𝒟 , n ) q n = j = 1 ( 1 + q j ) = j = 1 1 1 q 2 j 1 = 1 + m = 1 q m ( m + 1 ) / 2 ( 1 q ) ( 1 q 2 ) ( 1 q m ) = 1 + m = 1 q m ( 1 + q ) ( 1 + q 2 ) ( 1 + q m 1 ) ,
26.10.3 ( 1 x ) m , n = 0 p m ( k , 𝒟 , n ) x m q n = m = 0 k [ k m ] q q m ( m + 1 ) / 2 x m = j = 1 k ( 1 + x q j ) , | x | < 1 ,
26.10.4 n = 0 p ( 𝒟 k , n ) q n = 1 + m = 1 q ( k m 2 + ( 2 k ) m ) / 2 ( 1 q ) ( 1 q 2 ) ( 1 q m ) ,
where I 1 ( x ) is the modified Bessel function (§10.25(ii)), and …
2: 26.9 Integer Partitions: Restricted Number and Part Size
26.9.4 [ m n ] q = j = 1 n 1 q m n + j 1 q j , n 0 ,
is the Gaussian polynomial (or q -binomial coefficient); see also §§17.2(i)17.2(ii). …It is also assumed everywhere that | q | < 1 . … Also, when | x q | < 1
3: Bibliography K
  • R. B. Kearfott, M. Dawande, K. Du, and C. Hu (1994) Algorithm 737: INTLIB: A portable Fortran 77 interval standard-function library. ACM Trans. Math. Software 20 (4), pp. 447–459.
  • M. K. Kerimov (1980) Methods of computing the Riemann zeta-function and some generalizations of it. USSR Comput. Math. and Math. Phys. 20 (6), pp. 212–230.
  • A. V. Kitaev and A. H. Vartanian (2004) Connection formulae for asymptotics of solutions of the degenerate third Painlevé equation. I. Inverse Problems 20 (4), pp. 1165–1206.
  • T. H. Koornwinder (2009) The Askey scheme as a four-manifold with corners. Ramanujan J. 20 (3), pp. 409–439.
  • C. Krattenthaler (1993) HYP and HYPQ. Mathematica packages for the manipulation of binomial sums and hypergeometric series respectively q -binomial sums and basic hypergeometric series. Séminaire Lotharingien de Combinatoire 30, pp. 61–76.