Search Results for ""

The d-analog of a complex number s is defined as [s]_d=1-(2^d)/(s^d) (1) (Flajolet et al. 1995). For integer n, [2]!=1 and [n]_d! = [3][4]...[n] (2) = ...

A graph G having chromatic number chi(G)<=k is called a k-colorable graph (Harary 1994, p. 127). In contrast, a graph having chi(G)=k is said to be a k-chromatic graph. Note ...

The j-function is the modular function defined by j(tau)=1728J(tau), (1) where tau is the half-period ratio, I[tau]>0, ...

The process of taking the complement of a set or truth function. In the latter case, complementation is equivalent to the NOT operation.

A type I Markov move.

A positive-height (outward-pointing) pyramid used in augmentation. The term was introduced by B. Grünbaum.

A section of a graph obtained by finding its intersection with a plane.

To rearrange without cutting or pasting.

A type II Markov move.

The set closure of the set of arguments of a function f for which f is not zero.