Search Results for ""

Coding theory, sometimes called algebraic coding theory, deals with the design of error-correcting codes for the reliable transmission of information across noisy channels. ...

A completely positive matrix is a real n×n square matrix A=(a_(ij)) that can be factorized as A=BB^(T), where B^(T) stands for the transpose of B and B is any (not ...

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 ...

There are (at least) two graphs associated with Horton, illustrated above. The first is a graph on 96 nodes providing a counterexample to the Tutte conjecture that every ...

Lauricella functions are generalizations of the Gauss hypergeometric functions to multiple variables. Four such generalizations were investigated by Lauricella (1893), and ...

A prime ideal is an ideal I such that if ab in I, then either a in I or b in I. For example, in the integers, the ideal a=<p> (i.e., the multiples of p) is prime whenever p ...

The topology on the Cartesian product X×Y of two topological spaces whose open sets are the unions of subsets A×B, where A and B are open subsets of X and Y, respectively. ...

A tree having four branches at each node. Quadtrees are used in the construction of some multidimensional databases (e.g., cartography, computer graphics, and image ...

A recursive process is one in which objects are defined in terms of other objects of the same type. Using some sort of recurrence relation, the entire class of objects can ...

A recursive sequence {f(n)}_n, also known as a recurrence sequence, is a sequence of numbers f(n) indexed by an integer n and generated by solving a recurrence equation. The ...