Search Results for ""

A maximal independent vertex set of a graph is an independent vertex set that cannot be expanded to another independent vertex set by addition of any vertex in the graph. A ...

If a points A^', B^', and C^' are marked on each side of a triangle DeltaABC, one on each side (or on a side's extension), then the three Miquel circles (each through a ...

A n×n matrix A is an orthogonal matrix if AA^(T)=I, (1) where A^(T) is the transpose of A and I is the identity matrix. In particular, an orthogonal matrix is always ...

The Paris-Harrington theorem is a strengthening of the finite Ramsey's theorem by requiring that the homogeneous set be large enough so that cardH>=minH. Clearly, the ...

A space-filling function which maps a one-dimensional interval into a two-dimensional area. Plane-filling functions were thought to be impossible until Hilbert discovered the ...

The topology on the Cartesian product X×Y of two topological spaces whose open sets are the unions of subsets A×B, where A and B are open subsets of X and Y, respectively. ...

A rolling polyhedron graph is a graph obtained by rolling a polyhedral solid along a board whose tiles match up with the faces of the polyhedron being rolled. The vertices of ...

"Stampacchia's theorem" is a name given to any number of related results in functional analysis, and while the body of the theorem often varies depending on the literature ...

The supremum is the least upper bound of a set S, defined as a quantity M such that no member of the set exceeds M, but if epsilon is any positive quantity, however small, ...

A symbol consisting of three rational numbers that can be used to describe uniform polyhedra based on how a point C in a spherical triangle can be selected so as to trace the ...