Search Results for ""

The geodesics in a complete Riemannian metric go on indefinitely, i.e., each geodesic is isometric to the real line. For example, Euclidean space is complete, but the open ...

A sequence of numbers V={nu_n} is complete if every positive integer n is the sum of some subsequence of V, i.e., there exist a_i=0 or 1 such that n=sum_(i=1)^inftya_inu_i ...

The expected number of trials needed to collect a complete set of n different objects when picked at random with repetition is nH_n (Havil 2003, p. 131). For n=1, 2, ..., the ...

A space of functions comprising a complete biorthogonal system.

A surface which has no edges.

A labeled ternary tree containing the labels 1 to n with root 1, branches leading to nodes labeled 2, 3, 4, branches from these leading to 5, 6, 7 and 8, 9, 10 respectively, ...

The graph corresponding to the complete k-ary tree on n nodes is implemented in the Wolfram Language as KaryTree[n, k].

A complete tripartite graph is the k=3 case of a complete k-partite graph. In other words, it is a tripartite graph (i.e., a set of graph vertices decomposed into three ...

A complete k-partite graph is a k-partite graph (i.e., a set of graph vertices decomposed into k disjoint sets such that no two graph vertices within the same set are ...

A completely monotonic function is a function f(x) such that (-1)^(-n)f^((n))(x)>=0 for n=0, 1, 2, .... Such functions occur in areas such as probability theory (Feller ...