Search Results for ""

A compactum (plural: compacta) is a compact metric space. An example of a compactum is any finite discrete metric space. Also, the space [0,1] union [2,3] is a compactum, ...

The comparability graph of a partially ordered set P=(X,<=) is the graph with vertex set X for which vertices x and y are adjacent iff either x<=y or y<=x in P.

Let ||A|| be the matrix norm associated with the matrix A and |x| be the vector norm associated with a vector x. Let the product Ax be defined, then ||A|| and |x| are said to ...

Two angles alpha and beta are said to be complementary if alpha+beta=pi/2. In other words, alpha and beta are complementary angles if they produce a right angle when combined.

An axiomatic theory (such as a geometry) is said to be complete if each valid statement in the theory is capable of being proven true or false.

Complete digraphs are digraphs in which every pair of nodes is connected by a bidirectional edge.

A complete multipartite graph is a graph that is a complete k-partite graph for some positive integer k (Chartrand and Zhang 2008, p. 41).

A space of functions comprising a complete biorthogonal system.

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

The conversion of a quadratic polynomial of the form ax^2+bx+c to the form a(x+b/(2a))^2+(c-(b^2)/(4a)), which, defining B=b/2a and C=c-b^2/4a, simplifies to a(x+B)^2+C.