Search Results for ""

A quadratic form Q(z) is said to be positive definite if Q(z)>0 for z!=0. A real quadratic form in n variables is positive definite iff its canonical form is ...

A type of binary tree.

The value of the 2^0 bit in a binary number. For the sequence of numbers 1, 2, 3, 4, ..., the least significant bits are therefore the alternating sequence 1, 0, 1, 0, 1, 0, ...

The resolution principle, due to Robinson (1965), is a method of theorem proving that proceeds by constructing refutation proofs, i.e., proofs by contradiction. This method ...

Let d_G(k) be the number of dominating sets of size k in a graph G, then the domination polynomial D_G(x) of G in the variable x is defined as ...

A field K is said to be an extension field (or field extension, or extension), denoted K/F, of a field F if F is a subfield of K. For example, the complex numbers are an ...

A root-finding method which was among the most popular methods for finding roots of univariate polynomials in the 19th and 20th centuries. It was invented independently by ...

A connection on a vector bundle pi:E->M is a way to "differentiate" bundle sections, in a way that is analogous to the exterior derivative df of a function f. In particular, ...

The Golay code is a perfect linear error-correcting code. There are two essentially distinct versions of the Golay code: a binary version and a ternary version. The binary ...

A (0,1)-matrix is an integer matrix in which each element is a 0 or 1. It is also called a logical matrix, binary matrix, relation matrix, or Boolean matrix. The number of ...