Search Results for ""

The conjecture that there are only finitely many triples of relatively prime integer powers x^p, y^q, z^r for which x^p+y^q=z^r (1) with 1/p+1/q+1/r<1. (2) Darmon and Merel ...

In the IEEE 754-2008 standard (referred to as IEEE 754 henceforth), a floating-point representation is an unencoded member of a floating-point format which represents either ...

There are three types of so-called fundamental forms. The most important are the first and second (since the third can be expressed in terms of these). The fundamental forms ...

Given a real m×n matrix A, there are four associated vector subspaces which are known colloquially as its fundamental subspaces, namely the column spaces and the null spaces ...

Given an m×n matrix A, the fundamental theorem of linear algebra is a collection of results relating various properties of the four fundamental matrix subspaces of A. In ...

The following are equivalent definitions for a Galois extension field (also simply known as a Galois extension) K of F. 1. K is the splitting field for a collection of ...

The generalized Gell-Mann matrices are the n^2-1 matrices generating the Lie algebra associated to the special unitary group SU(n), n>=2. As their name suggests, these ...

A number of strongly regular graphs of several types derived from combinatorial design were identified by Goethals and Seidel (1970). Theorem 2.4 of Goethals and Seidel ...

A bridge of a connected graph is a graph edge whose removal disconnects the graph (Chartrand 1985, p. 45; Skiena 1990, p. 177). More generally, a bridge is an edge of a ...

A Hamiltonian walk on a connected graph is a closed walk of minimal length which visits every vertex of a graph (and may visit vertices and edges multiple times). For ...