Search Results for ""

The logical axiom R(x,y)=!(!(x v y) v !(x v !y))=x, where !x denotes NOT and x v y denotes OR, that, when taken together with associativity and commutativity, is equivalent ...

Two algebraic objects that are commutative, i.e., A and B such that A*B=B*A for some operation *, are said to commute with each other.

A projective plane, sometimes called a twisted sphere (Henle 1994, p. 110), is a surface without boundary derived from a usual plane by addition of a line at infinity. Just ...

A biconnected graph is a connected graph having no articulation vertices (Skiena 1990, p. 175). An equivalent definition for graphs on more than two vertices is a graph G ...

Any square matrix T has a canonical form without any need to extend the field of its coefficients. For instance, if the entries of T are rational numbers, then so are the ...

A totalistic cellular automaton is a cellular automata in which the rules depend only on the total (or equivalently, the average) of the values of the cells in a ...

The word canonical is used to indicate a particular choice from of a number of possible conventions. This convention allows a mathematical object or class of objects to be ...

Let G be a group and S be a topological G-set. Then a closed subset F of S is called a fundamental domain of G in S if S is the union of conjugates of F, i.e., S= union _(g ...

Gram's law (Hutchinson 1925; Edwards 2001, pp. 125, 127, and 171) is the tendency for zeros of the Riemann-Siegel function Z(t) to alternate with Gram points. Stated more ...

The Janko-Kharaghani graphs are two strongly regular graph on 936 and 1800 vertices. They have regular parameters (nu,k,lambda,mu)=(936,375,150,150) and (1800,1029,588,588), ...