Search Results for ""

The quantum of a finite floating-point representation is the value of a unit in the last position of its significand. In general, the quantum is equal to the radix raised to ...

A game is defined as a conflict involving gains and losses between two or more opponents who follow formal rules. The study of games belongs to a branch of mathematics known ...

Given two groups G and H, there are several ways to form a new group. The simplest is the direct product, denoted G×H. As a set, the group direct product is the Cartesian ...

As of 2014, the IEEE 754-2008 is the most commonly implemented standard for floating-point arithmetic. This framework is a massive overhaul of its predecessor IEEE 754-1985 ...

A matrix whose entries are all integers. Special cases which arise frequently are those having only (-1,1) as entries (e.g., Hadamard matrix), (0,1)-matrices having only ...

The Kuratowski reduction theorem states that very nonplanar graph contains either the utility graph UG=K_(3,3) or the pentatope graph K_5 as a graph minor. The graphs K_(3,3) ...

Nonhomogeneous matrix equations of the form Ax=b (1) can be solved by taking the matrix inverse to obtain x=A^(-1)b. (2) This equation will have a nontrivial solution iff the ...

The Norton-Smith graph is a weakly regular graph on 1134 vertices with regular parameters (nu,k,lambda,mu)=(1134,117,36,(0,12)). It is distance-regular as well as ...

Two totally ordered sets (A,<=) and (B,<=) are order isomorphic iff there is a bijection f from A to B such that for all a_1,a_2 in A, a_1<=a_2 iff f(a_1)<=f(a_2) (Ciesielski ...

The graph complement of a perfect graph is itself perfect. Originally known as the weak perfect graph conjecture (Fulkerson 1971), the result was subsequently proved by ...