Search Results for ""

Let the vertices of a graph G be numbered with distinct integers 1 to |G|. Then the dilation of G is the maximum (absolute) difference between integers assigned to adjacent ...

A fast Fourier transform-like algorithm which produces a hologram of an image.

The largest unit fraction, 1/2. 1/2 is a rational number with terminating decimal expansion 0.5.

The Hamming distance between two vertices of a hypercube is the number of coordinates at which the two vertices differ.

An n-dimensional manifold M is said to be a homotopy sphere, if it is homotopy equivalent to the n-sphere S^n. Thus no homotopy group can distinguish between M and S^n. The ...

A sequence {x_n} is called an infinitive sequence if, for every i, x_n=i for infinitely many n. Write a(i,j) for the jth index n for which x_n=i. Then as i and j range ...

The Krohn-Rhodes complexity, also called the group complexity or simply "the complexity," of a finite semigroup S is the smallest number of groups in a wreath product of ...

The order n>=2 L-polyomino consists of a vertical line of n squares with a single additional square attached at the bottom.

The inverse curve of the lituus is an Archimedean spiral with m=2, which is Fermat's spiral.

A number triangle of order n with entries 1 to n such that entries are nondecreasing across rows and down columns and all entries in column j are less than or equal to j. An ...