Search Results for ""

The term "transition matrix" is used in a number of different contexts in mathematics. In linear algebra, it is sometimes used to mean a change of coordinates matrix. In the ...

A relation R on a set S is transitive provided that for all x, y and z in S such that xRy and yRz, we also have xRz.

The transitive closure of a binary relation R on a set X is the minimal transitive relation R^' on X that contains R. Thus aR^'b for any elements a and b of X provided that ...

A graph G is transitive if any three vertices (x,y,z) such that edges (x,y),(y,z) in G imply (x,z) in G. Unlabeled transitive digraphs are called digraph topologies.

Transitivity is a result of the symmetry in the group. A group G is called transitive if its group action (understood to be a subgroup of a permutation group on a set Omega) ...

A group action G×X->X is transitive if it possesses only a single group orbit, i.e., for every pair of elements x and y, there is a group element g such that gx=y. In this ...

Two points on a surface which are opposite to each other but not farthest from each other (e.g., the midpoints of opposite edges of a cube) are said to be transitive points. ...

The transitive reduction of a binary relation R on a set X is the minimum relation R^' on X with the same transitive closure as R. Thus aR^'b for any elements a and b of X, ...

The 3-node tournament (and directed graph) illustrated above (Harary 1994, p. 205).

Let S(T) be the group of symmetries which map a monohedral tiling T onto itself. The transitivity class of a given tile T is then the collection of all tiles to which T can ...