Search Results for ""

The lower clique number omega_L(G) of a graph G may be defined as the size of a smallest maximal clique in a graph G. It therefore corresponds to the coefficient of the ...

The maximal matching-generating polynomial M_G(x) for the graph G may be defined as the polynomial M_G(x)=sum_(k=nu_L(G))^(nu(G))m_kx^k, where nu_L(G) is the lower matching ...

A set-like object in which order is ignored, but multiplicity is explicitly significant. Therefore, multisets {1,2,3} and {2,1,3} are equivalent, but {1,1,2,3} and {1,2,3} ...

Each subsequent row of Pascal's triangle is obtained by adding the two entries diagonally above. This follows immediately from the binomial coefficient identity (n; r) = ...

Orthogonal polynomials associated with weighting function w(x) = pi^(-1/2)kexp(-k^2ln^2x) (1) = pi^(-1/2)kx^(-k^2lnx) (2) for x in (0,infty) and k>0. Defining ...

Algebra

The function defined by [n]_q = [n; 1]_q (1) = (1-q^n)/(1-q) (2) for integer n, where [n; k]_q is a q-binomial coefficient. The q-bracket satisfies lim_(q->1^-)[n]_q=n. (3)

The Lorenz curve is used in economics and ecology to describe inequality in wealth or size. The Lorenz curve is a function of the cumulative proportion of ordered individuals ...

The number of ways of picking k unordered outcomes from n possibilities. Also known as the binomial coefficient or choice number and read "n choose k," _nC_k=(n; ...

Given binomial coefficient (N; k), write N-k+i=a_ib_i, for 1<=i<=k, where b_i contains only those prime factors >k. Then the number of i for which b_i=1 (i.e., for which all ...