Search Results for ""

An idealized computing machine consisting of a fixed set of data registers and set of instructions for operating on them. Register machines are also known as counter machines ...

The Grassmannian Gr(n,k) is the set of k-dimensional subspaces in an n-dimensional vector space. For example, the set of lines Gr(n+1,1) is projective space. The real ...

The determination of the number of monotone Boolean functions of n variables (equivalent to the number of antichains on the n-set {1,2,...,n}) is called Dedekind's problem, ...

A finite set of contraction maps w_i for i=1, 2, ..., N, each with a contractivity factor s<1, which map a compact metric space onto itself. It is the basis for fractal image ...

A polyform of 30-60-90 triangles. The name was coined by Ed Pegg, Jr. because of the 30-60-90 triangle's use in mechanical drawing and drafting. The Eternity puzzle is based ...

Abstract algebra is the set of advanced topics of algebra that deal with abstract algebraic structures rather than the usual number systems. The most important of these ...

A commutative diagram is a collection of maps A_i-->^(phi_i)B_i in which all map compositions starting from the same set A and ending with the same set B give the same ...

Let s_k be the number of independent vertex sets of cardinality k in a graph G. The polynomial I(x)=sum_(k=0)^(alpha(G))s_kx^k, (1) where alpha(G) is the independence number, ...

In discrete percolation theory, bond percolation is a percolation model on a regular point lattice L=L^d in d-dimensional Euclidean space which considers the lattice graph ...

A bar (also called an overbar) is a horizontal line written above a mathematical symbol to give it some special meaning. If the bar is placed over a single symbol, as in x^_ ...