Search Results for ""

If the abstract simplicial complex S is isomorphic with the vertex scheme of the simplicial complex K, then K is said to be a geometric realization of S, and is uniquely ...

The geometric span is largest possible distance between two points drawn from a finite set of points. It is therefore closely related to the generalized diameter of a closed ...

The likelihood of a simple graph is defined by starting with the set S_1={(K_11)}. The following procedure is then iterated to produce a set of graphs G_n of order n. At step ...

A loop of an graph is degenerate edge that joins a vertex to itself, also called a self-loop. A simple graph cannot contain any loops, but a pseudograph can contain both ...

The dual of the great snub dodecicosidodecahedron and Wenninger dual W_(115).

The dual of the great truncated icosahedron U_(55) and Wenninger dual W_(95).

The dual of the stellated truncated hexahedron U_(19) and Wenninger dual W_(92)

An approach for the calculation of a Gröbner basis into several smaller computations following a path in the Gröbner fan of the ideal generated by the system of inequalities.

A honeycomb-like packing that forms hexagons.

Consider a clause (disjunction of literals) obtained from those of a first-order logic formula Phi in Skolemized form forall x_1... forall x_nS. Then an atomic statement ...