combinatorial matrix
Смотреть что такое "combinatorial matrix" в других словарях:
Combinatorial species — In combinatorial mathematics, the theory of combinatorial species is an abstract, systematic method for analysing discrete structures in terms of generating functions. Examples of discrete structures are (finite) graphs, permutations, trees, and… … Wikipedia
Diagonally dominant matrix — In mathematics, a matrix is said to be diagonally dominant if for every row of the matrix, the magnitude of the diagonal entry in a row is larger than or equal to the sum of the magnitudes of all the other (non diagonal) entries in that row. More … Wikipedia
Conference matrix — In mathematics, a conference matrix (also called a C matrix) is a square matrix C with 0 on the diagonal and +1 and −1 off the diagonal, such that CTC is a multiple of the identity matrix I. Thus, if the matrix has order n, CTC = (n−1)I … Wikipedia
Disjunct matrix — Disjunct and separable matrices play a pivotal role in the mathematical area of non adaptive group testing. This area investigates efficient designs and procedures to identify needles in haystacks by conducting the tests on groups of items… … Wikipedia
Kalmanson combinatorial conditions — In mathematics, the Kalmanson combinatorial conditions are a set of conditions on the distance matrix used in determining the solvability of the traveling salesman problem. These conditions apply to a special kind of cost matrix, the Kalmanson… … Wikipedia
Hadamard matrix — In mathematics, a Hadamard matrix is a square matrix whose entries are either +1 or −1 and whose rows are mutually orthogonal. This means that every two different rows in a Hadamard matrix represent two perpendicular vectors. Such matrices can… … Wikipedia
Unimodular matrix — In mathematics, a unimodular matrix M is a square integer matrix with determinant +1 or −1. Equivalently, it is an integer matrix that is invertible over the integers: there is an integer matrix N which is its inverse (these are equivalent under… … Wikipedia
Alternating sign matrix — In mathematics, an alternating sign matrix is a square matrix of 0s, 1s, and −1s such that the sum of each row and column is 1 and the nonzero entries in each row and column alternate in sign. These matrices arise naturally when using Dodgson… … Wikipedia
Regular Hadamard matrix — In mathematics a regular Hadamard matrix is a Hadamard matrix whose row and column sums are all equal. While the order of a Hadamard matrix must be 1, 2, or a multiple of 4, regular Hadamard matrices carry the further restriction that the order… … Wikipedia
Butson-type Hadamard matrix — In mathematics, a complex Hadamard matrix H of size N with all its columns (rows) mutually orthogonal, belongs to the Butson type H ( q , N ) if all its elements are powers of q th root of unity,:: (H {jk})^q=1 {quad m for quad} j,k=1,2,dots,N.… … Wikipedia
Perron–Frobenius theorem — In linear algebra, the Perron–Frobenius theorem, proved by Oskar Perron (1907) and Georg Frobenius (1912), asserts that a real square matrix with positive entries has a unique largest real eigenvalue and that the corresponding… … Wikipedia
