Search Results for ""

A square matrix with constant skew diagonals. In other words, a Hankel matrix is a matrix in which the (i,j)th entry depends only on the sum i+j. Such matrices are sometimes ...

Given 2n-1 numbers a_k, where k=-n+1, ..., -1, 0, 1, ..., n-1, a Toeplitz matrix is a matrix which has constant values along negative-sloping diagonals, i.e., a matrix of the ...

A unit matrix is an integer matrix consisting of all 1s. The m×n unit matrix is often denoted J_(mn), or J_n if m=n. Square unit matrices J_n have determinant 0 for n>=2. An ...

Matrix diagonalization is the process of taking a square matrix and converting it into a special type of matrix--a so-called diagonal matrix--that shares the same fundamental ...

Hadamard matrices H_n can be constructed using finite field GF(p^m) when p=4l-1 and m is odd. Pick a representation r relatively prime to p. Then by coloring white ...

The adjacency matrix, sometimes also called the connection matrix, of a simple labeled graph is a matrix with rows and columns labeled by graph vertices, with a 1 or 0 in ...

The incidence matrix of a graph gives the (0,1)-matrix which has a row for each vertex and column for each edge, and (v,e)=1 iff vertex v is incident upon edge e (Skiena ...

A conjugate matrix is a matrix A^_ obtained from a given matrix A by taking the complex conjugate of each element of A (Courant and Hilbert 1989, p. 9), i.e., ...

A (2n)×(2n) complex matrix A in C^(2n×2n) is said to be Hamiltonian if J_nA=(J_nA)^(H), (1) where J_n in R^(2n×2n) is the matrix of the form J_n=[0 I_n; I_n 0], (2) I_n is ...

Let F(m,n) be the number of m×n (0,1)-matrices with no adjacent 1s (in either columns or rows). For n=1, 2, ..., F(n,n) is given by 2, 7, 63, 1234, ... (OEIS A006506). The ...