Search Results for ""

The complexity of a pattern parameterized as the shortest algorithm required to reproduce it. Also known as bit complexity.

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

A lag system, introduced by Wang (1963), is a sort of opposite to a tag system. Lag systems allow dependence on more than just the first element, but remove only the first ...

The numbers B_(n,k)(1!,2!,3!,...)=(n-1; k-1)(n!)/(k!), where B_(n,k) is a Bell polynomial.

Let a graph G have exactly 2n-3 graph edges, where n is the number of graph vertices in G. Then G is "generically" rigid in R^2 iff e^'<=2n^'-3 for every subgraph of G having ...

A distinct (including reflections and rotations) arrangement of adjacent squares on a grid, also called a fixed polyomino.

A point at the intersection of two or more grid lines in a point lattice.

A letter is an element of an alphabet. A collection of letters forms a word.

A type of diagram invented by Lewis Carroll (the name is an abbreviation of "Lewis") that can be used to determine the number of minimal covers of n numbers with k members.

A limb of a tree at a vertex v is the union of one or more branches at v in the tree. v is then called the base of the limb.