Search Results for ""

A self-complementary graph is a graph which is isomorphic to its graph complement. The numbers of simple self-complementary graphs on n=1, 2, ... nodes are 1, 0, 0, 1, 2, 0, ...

An action with G=R^+.

The probability that a statistical test will be positive for a true statistic.

A translation without rotation or distortion.

The edge of a polygon or face of a polyhedron are sometimes called sides.

To multiply the size of a d-D object by a factor a, c=a^d copies are required, and the quantity d=(lnc)/(lna) is called the similarity dimension.

An algebra with no nontrivial ideals.

A simple directed graph is a directed graph having no multiple edges or graph loops (corresponding to a binary adjacency matrix with 0s on the diagonal). The number of simple ...

The type of homology which results when the spaces being studied are restricted to simplicial complexes and subcomplexes.

If (sinalpha)/(sinbeta)=m/n, then (tan[1/2(alpha-beta)])/(tan[1/2(alpha+beta)])=(m-n)/(m+n).