Search Results for ""

The study of the waiting times, lengths, and other properties of queues.

A random composition of a number n in k parts is one of the (n+k-1; n) possible compositions of n, where (n; k) is a binomial coefficient. A random composition can be given ...

A statistical test making use of the statistical ranks of data points. Examples include the Kolmogorov-Smirnov test and Wilcoxon signed rank test.

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 ...

The ordinal number of a value in a list arranged in a specified order (usually decreasing).

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, .... ...