TOPICS
Search

Search Results for ""


1391 - 1400 of 2001 for Dominating Unique GraphsSearch Results
Given an m×n matrix B, the Moore-Penrose generalized matrix inverse is a unique n×m matrix pseudoinverse B^+. This matrix was independently defined by Moore in 1920 and ...
In a set X equipped with a binary operation · called a product, the multiplicative identity is an element e such that e·x=x·e=x for all x in X. It can be, for example, the ...
Let A be a non-unital C^*-algebra. There is a unique (up to isomorphism) unital C^*-algebra which contains A as an essential ideal and is maximal in the sense that any other ...
A multivalued function, also known as a multiple-valued function (Knopp 1996, part 1 p. 103), is a "function" that assumes two or more distinct values in its range for at ...
Let C be an error-correcting code consisting of N codewords in which each codeword consists of n letters taken from an alphabet A of length q, and every two distinct ...
Let C be an error-correcting code consisting of N codewords,in which each codeword consists of n letters taken from an alphabet A of length q, and every two distinct ...
A permutation matrix is a matrix obtained by permuting the rows of an n×n identity matrix according to some permutation of the numbers 1 to n. Every row and column therefore ...
An n-he (a term coined by Brendan Owen) is a shape formed from a polyhex by removing half of each hexagon in such a way that the remaining pieces are connected (Clarke). The ...
A triangle with rows containing the numbers {1,2,...,n} that begins with 1, ends with n, and such that the sum of each two consecutive entries being a prime. Rows 2 to 6 are ...
The unique nonnegative square root of a nonnegative real number. For example, the principal square root of 9 is 3, although both -3 and 3 are square roots of 9. The concept ...
1 ... 137|138|139|140|141|142|143 ... 201 Previous Next

...