Search Results for ""

The m×n rook complement graph K_m square K_n^_ is the graph complement of the m×n rook graph. It has vertex count mn and edge count 2(m; 2)(n; 2), where (n; k) is a binomial ...

A definition of a function using a contour integral. Schläfli integrals may be converted into Rodrigues representations.

Let R+B be the number of monochromatic forced triangles (where R and B are the number of red and blue triangles) in an extremal graph. Then R+B=(n; 3)-|_1/2n|_1/4(n-1)^2_|_|, ...

The maximum cardinal number of a collection of subsets of a t-element set T, none of which contains another, is the binomial coefficient (t; |_t/2_|), where |_x_| is the ...

f_p=f_0+1/2p(p+1)delta_(1/2)-1/2(p-1)pdelta_(-1/2) +(S_3+S_4)delta_(1/2)^3+(S_3-S_4)delta_(-1/2)^3+..., (1) for p in [-1/2,1/2], where delta is the central difference and ...

Let b(k) be the number of 1s in the binary expression of k, i.e., the binary digit count of 1, giving 1, 1, 2, 1, 2, 2, 3, 1, 2, 2, 3, ... (OEIS A000120) for k=1, 2, .... ...

The Wigner 3j-symbols (j_1 j_2 j_3; m_1 m_2 m_3), also known as "3j symbols" (Messiah 1962, p. 1056) or Wigner coefficients (Shore and Menzel 1968, p. 275) are quantities ...

Two patterns T_1 and T_2 belong to the same Wilf class if |S_n(T_1)|=|S_n(T_2)| for all n, where S_n(T) denotes the set of permutations on {1,...,n} that avoid the pattern T. ...

A lattice path from one point to another is p-good if it lies completely below the line y=(p-1)x. (1) Hilton and Pederson (1991) show that the number of p-good paths from (1, ...

sum_(y=0)^m(-1)^(m-y)q^((m-y; 2))[m; y]_q(1-wq^m)/(q-wq^y) ×(1-wq^y)^m(-(1-z)/(1-wq^y);q)_y=(1-z)^mq^((m; 2)), where [n; y]_q is a q-binomial coefficient.