Search Results for ""

If {a_0,a_1,...} is a recursive sequence, then the set of all k such that a_k=0 is the union of a finite (possibly empty) set and a finite number (possibly zero) of full ...

A Skolem sequence of order n is a sequence S={s_1,s_2,...,s_(2n)} of 2n integers such that 1. For every k in {1,2,...,n}, there exist exactly two elements s_i,s_j in S such ...

Assemble six 1×2×2 blocks and three 1×1×1 blocks into a 3×3×3 cube.

In a network with three graph edges at each graph vertex, the number of Hamiltonian cycles through a specified graph edge is 0 or even.

The 6-polyiamond illustrated above.

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.

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 ...