Search Results for ""

An n-Hadamard graph is a graph on 4n vertices defined in terms of a Hadamard matrix H_n=(h)_(ij) as follows. Define 4n symbols r_i^+, r_i^-, c_i^+, and c_i^-, where r stands ...

A Hadamard matrix is a type of square (-1,1)-matrix invented by Sylvester (1867) under the name of anallagmatic pavement, 26 years before Hadamard (1893) considered them. In ...

A symmetric block design (4n+3, 2n+1, n) which is equivalent to a Hadamard matrix of order 4n+4. It is conjectured that Hadamard designs exist for all integers n>0, but this ...

The Hadamard product is a representation for the Riemann zeta function zeta(s) as a product over its nontrivial zeros rho, ...

Let f be an entire function of finite order lambda and {a_j} the zeros of f, listed with multiplicity, then the rank p of f is defined as the least positive integer such that ...

Hadamard's maximum determinant problem asks to find the largest possible determinant (in absolute value) for any n×n matrix whose elements are taken from some set. Hadamard ...

Bracewell's term for the rectangle function.

Let A=a_(ik) be an arbitrary n×n nonsingular matrix with real elements and determinant |A|, then |A|^2<=product_(i=1)^n(sum_(k=1)^na_(ik)^2).

Let |A| be an n×n determinant with complex (or real) elements a_(ij), then |A|!=0 if |a_(ii)|>sum_(j=1; j!=i)^n|a_(ij)|.

A fast Fourier transform-like algorithm which produces a hologram of an image.