Search Results for ""

A reduction system is called confluent (or globally confluent) if, for all x, u, and w such that x->_*u and x->_*w, there exists a z such that u->_*z and w->_*z. A reduction ...

The homomorphism S which, according to the snake lemma, permits construction of an exact sequence (1) from the above commutative diagram with exact rows. The homomorphism S ...

The contact triangle of a triangle DeltaABC, also called the intouch triangle, is the triangle DeltaC_AC_BC_C formed by the points of tangency of the incircle of DeltaABC ...

Pairs of primes of the form (p, p+4) are called cousin primes. The first few are (3, 7), (7, 11), (13, 17), (19, 23), (37, 41), (43, 47), (67, 71), ... (OEIS A023200 and ...

The cuban primes, named after differences between successive cubic numbers, have the form n^3-(n-1)^3. The first few are 7, 19, 37, 61, 127, 271, ... (OEIS A002407), which ...

Given a number z, the cube root of z, denoted RadicalBox[z, 3] or z^(1/3) (z to the 1/3 power), is a number a such that a^3=z. The cube root is therefore an nth root with ...

Deck transformations, also called covering transformations, are defined for any cover p:A->X. They act on A by homeomorphisms which preserve the projection p. Deck ...

A demiregular tessellation, also called a polymorph tessellation, is a type of tessellation whose definition is somewhat problematical. Some authors define them as orderly ...

Dijkstra's algorithm is an algorithm for finding a graph geodesic, i.e., the shortest path between two graph vertices in a graph. It functions by constructing a shortest-path ...

Direct sums are defined for a number of different sorts of mathematical objects, including subspaces, matrices, modules, and groups. The matrix direct sum is defined by ...