Search Results for ""

The slicing of a three-dimensional object by a plane (or more general slice).

A theory is decidable iff there is an algorithm which can determine whether or not any sentence r is a member of the theory.

A rewriting of a given quantity (e.g., a matrix) in terms of a combination of "simpler" quantities.

The desmic configuration is three-dimensional configuration of points consisting of three tetrads of points, each two of the tetrads of which are perspective from the four ...

Two manifolds are said to be diffeomorphic if there exists a diffeomorphism between them.

The digraph intersection of two digraphs is the digraph whose vertex set (respectively, edge set) is the intersection of their vertex sets (respectively, edge sets). If n is ...

One of the Eilenberg-Steenrod axioms. Let X be a single point space. H_n(X)=0 unless n=0, in which case H_0(X)=G where G are some groups. The H_0 are called the coefficients ...

Characterized by allowing only integer values.

The disorder number of a simple connected graph on n vertices is defined as the maximum length of a walk along the edges of the graph taken over all ordering of its vertices ...

Let D be a set of positive numbers containing 1, then the D-distance graph X(D) on a nonempty subset X of Euclidean space is the graph with vertex set X and edge set ...