Search Results for ""

The first of the Hardy-Littlewood conjectures. The k-tuple conjecture states that the asymptotic number of prime constellations can be computed explicitly. In particular, ...

A quasigroup with an identity element e such that xe=x and ex=x for any x in the quasigroup. All groups are loops. In general, loops are considered to have very little in the ...

Algorithmic graph theory is the study of graph traversal and generation and the complexity of these operations. Topics in algorithmic graph theory include Eulerian and ...

The Behrmann cylindrical equal-area projection is a cylindrical equal-area projection with a standard parallel of phi_s=30 degrees.

The Byzantine generals problem considers a computer with many programs running, some of them possibly unfriendly, and asks how the computer can function properly. More ...

The commutator subgroup (also called a derived group) of a group G is the subgroup generated by the commutators of its elements, and is commonly denoted G^' or [G,G]. It is ...

A condition in numerical equation solving which states that, given a space discretization, a time step bigger than some computable quantity should not be taken. The condition ...

A chord of a graph cycle C is an edge not in the edge set of C whose endpoints lie in the vertex set C (West 2000, p. 225). For example, in the diamond graph as labeled ...

The Delsarte graph is a strongly regular graph on 243 vertices with regular parameters (nu,k,lambda,mu)=(243,110,37,60). It is distance-regular as well as distance-transitive ...

A dyadic, also known as a vector direct product, is a linear polynomial of dyads AB+CD+... consisting of nine components A_(ij) which transform as (A_(ij))^' = ...