TOPICS
Search

Search Results for ""


991 - 1000 of 1041 for Polyhedral FormulaSearch Results
The number of representations of n by k squares, allowing zeros and distinguishing signs and order, is denoted r_k(n). The special case k=2 corresponding to two squares is ...
An Abelian group is a group for which the elements commute (i.e., AB=BA for all elements A and B). Abelian groups therefore correspond to groups with symmetric multiplication ...
The Barnes G-function is an analytic continuation of the G-function defined in the construction of the Glaisher-Kinkelin constant G(n)=([Gamma(n)]^(n-1))/(H(n-1)) (1) for ...
The nth central binomial coefficient is defined as (2n; n) = ((2n)!)/((n!)^2) (1) = (2^n(2n-1)!!)/(n!), (2) where (n; k) is a binomial coefficient, n! is a factorial, and n!! ...
The Chebyshev polynomials of the first kind are a set of orthogonal polynomials defined as the solutions to the Chebyshev differential equation and denoted T_n(x). They are ...
The chromatic invariant theta(G) of a connected graph G is the number of spanning trees of G that have internal activity 1 and external activity 0. For graphs other than the ...
The chromatic polynomial pi_G(z) of an undirected graph G, also denoted C(G;z) (Biggs 1973, p. 106) and P(G,x) (Godsil and Royle 2001, p. 358), is a polynomial which encodes ...
A circulant graph is a graph of n graph vertices in which the ith graph vertex is adjacent to the (i+j)th and (i-j)th graph vertices for each j in a list l. The circulant ...
A die (plural "dice") is a solid with markings on each of its faces. The faces are usually all the same shape, making Platonic solids and Archimedean duals the obvious ...
The number of digits D in an integer n is the number of numbers in some base (usually 10) required to represent it. The numbers 1 to 9 are therefore single digits, while the ...
1 ... 97|98|99|100|101|102|103 ... 105 Previous Next

...