Search Results for ""

The convexity coefficient chi(D) of a region D is the probability that the line segment connecting two random points in D is contained entirely within D. For a convex region, ...

The Racah V-coefficients are written V(j_1j_2j;m_1m_2m) (1) and are sometimes expressed using the related Clebsch-Gordan coefficients C_(m_1m_2)^j=(j_1j_2m_1m_2|j_1j_2jm), ...

The Racah W-coefficients, sometimes simply called the Racah coefficients (Shore and Menzel 1968, p. 279), are quantities introduced by Racah (1942) that are related to the ...

A trinomial coefficient is a coefficient of the trinomial triangle. Following the notation of Andrews (1990), the trinomial coefficient (n; k)_2, with n>=0 and -n<=k<=n, is ...

The binomial coefficient (n; k) is the number of ways of picking k unordered outcomes from n possibilities, also known as a combination or combinatorial number. The symbols ...

Coefficients which appear in Lagrange interpolating polynomials where the points are equally spaced along the abscissa.

A binomial coefficient (N; k) with k>=2 is called good if its least prime factor satisfies lpf(N; k)>k (Erdős et al. 1993). This is equivalent to the requirement that GCD((N; ...

A binomial coefficient (N; k) is said to be exceptional if lpf(N; k)>N/k. The following table gives the exception binomial coefficients which are also good binomial ...

The nth central trinomial coefficient is defined as the coefficient of x^n in the expansion of (1+x+x^2)^n. It is therefore the middle column of the trinomial triangle, i.e., ...

The mean clustering coefficient of a graph G is the average of the local clustering coefficients of G. It is implemented in the Wolfram Language as ...