Search Results for ""

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

The maximum cardinal number of a collection of subsets of a t-element set T, none of which contains another, is the binomial coefficient (t; |_t/2_|), where |_x_| is the ...

The placement of n points on a sphere so as to minimize the maximum distance of any point on the sphere from the closest one of the n points.

The 6-polyiamond illustrated above, named for its resemblance to the Great Sphinx of Egypt.

A spigot algorithm is an algorithm which generates digits of a quantity one at a time without using or requiring previously computed digits. Amazingly, spigot algorithms are ...

A square grid is a grid formed by tiling the plane regularly with squares.

A stack is a data structure which is a special kind of list in which elements may be added to or removed from the top only. These actions are called a push or a pop, ...

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.

sum_(k=-infty)^infty(a; m-k)(b; n-k)(a+b+k; k)=(a+n; m)(b+m; n).

A fractal composed of repeated copies of a pentagram or other polygon. The above figure shows a generalization to different offsets from the center.