Search Results for ""

A crossing in a knot diagram for which there exists a circle in the projection plane meeting the diagram transversely at that crossing, but not meeting the diagram at any ...

Let the true value of a quantity be x and the measured or inferred value x_0. Then the relative error is defined by deltax=(Deltax)/x=(x_0-x)/x=(x_0)/x-1, where Deltax is the ...

Let G be a graph, and suppose each edge of G is independently deleted with fixed probability 0<=p<=1. Then the probability that no connected component of G is disconnected as ...

A removable singularity is a singular point z_0 of a function f(z) for which it is possible to assign a complex number in such a way that f(z) becomes analytic. A more ...

A tree of links obtained by repeatedly choosing a crossing, applying the skein relationship to obtain two simpler links, and repeating the process. The tree depth of a ...

The rhombic dodecahedral graph is the Archimedean dual graph which is the skeleton of the rhombic dodecahedron (as well as the Bilinski dodecahedron). It is the Levi graph of ...

A rhombohedron is a parallelepiped bounded by six rhombi such that opposite faces are congruent. A rhombohedron having all six rhombic faces congruent is known as a trigonal ...

There is a one-to-one correspondence between the sets of equivalent correspondences (not of value 0) on an irreducible curve of curve genus p, and the rational collineations ...

Rosser's rule states that every Gram block contains the expected number of roots, which appears to be true for computable Gram blocks. Rosser et al. (1969) expressed a belief ...

A specification of elements in a list as a list of pairs giving the element and number of times it occurs in a run. For example, given the list ...