Search Results for ""

A complete oriented graph (Skiena 1990, p. 175), i.e., a graph in which every pair of nodes is connected by a single uniquely directed edge. The first and second 3-node ...

A connective in logic which yields true if all conditions are true, and false if any condition is false. A AND B is denoted A ^ B (Mendelson 1997, p. 12), A&B, A intersection ...

There are a few plane curves known as "bean curves." The bean curve identified by Cundy and Rowllet (1989, p. 72) is the quartic curve given by the implicit equation ...

Intuitively, a model of d-dimensional percolation theory is said to be a Bernoulli model if the open/closed status of an area is completely random. In particular, it makes ...

The skeleton of the bislit cube is the 8-vertex simple graph, illustrated above in several embeddings, which consists of a cube in which two opposite faces have polyhedron ...

A board is a subset of the polygons determined by a number of (usually regularly spaced and oriented) lines. These polygons form the spaces on which "pieces" can be placed ...

In continuum percolation theory, the Boolean-Poisson model is a Boolean model driven by a stationary point process X which is a Poisson process. The Boolean-Poisson model is ...

Consider n strings, each oriented vertically from a lower to an upper "bar." If this is the least number of strings needed to make a closed braid representation of a link, n ...

A theorem which effectively describes how lengths, areas, volumes, and generalized n-dimensional volumes (contents) are distorted by differentiable functions. In particular, ...

A simple way to describe a knot projection. The advantage of this notation is that it enables a knot diagram to be drawn quickly. For an oriented alternating knot with n ...