Search Results for ""

Eliminate each knot crossing by connecting each of the strands coming into the crossing to the adjacent strand leaving the crossing. The resulting strands no longer cross but ...

Let a sequence {a_i}_(i=1)^infty be strictly increasing and composed of nonnegative integers. Call A(x) the number of terms not exceeding x. Then the density is given by ...

For a set S, the span is defined by maxS-minS, where max is the maximum and min is the minimum.

An operator T which commutes with all shift operators E^a, so TE^a=E^aT for all real a in a field. Any two shift-invariant operators commute.

An operator E such that E^ap(x)=p(x+a).

Let f(1)=1, and let f(n) be the number of occurrences of n in a nondecreasing sequence of integers. then the first few values of f(n) are 1, 2, 2, 3, 3, 4, 4, 4, 5, 5, 5, ... ...

A local source is a node of a directed graph with no entering edges (Borowski and Borwein 1991, p. 401; left figure), and a global source (often simply called a source) is a ...

A graphical partitioning based on the eigenvalues and eigenvectors of the Laplacian matrix of a graph.

A polynomial which is not necessarily an invariant of a link. It is related to the dichroic polynomial. It is defined by the skein relationship ...

A stack F on a topological space X is said to be a stack of groupoids if for each open subset U subset= X, the category F(U) is a groupoid.