Find link

language:

Find link is a tool written by Edward Betts.

searching for Integer matrix 23 found (38 total)

Mahler's compactness theorem (352 words) [view diff] exact match in snippet view article find links to article

determinant of a matrix – this is constant on the cosets, since an invertible integer matrix has determinant 1 or −1. Mahler's compactness theorem states that a

Hermite normal form (1,870 words) [view diff] exact match in snippet view article find links to article

unimodular matrix U {\displaystyle U} . A unimodular matrix is a square integer matrix whose determinant is 1 or −1 (and hence invertible). In fact, a unimodular

53 (number) (398 words) [view diff] no match in snippet view article

prime-universality criterion theorem (followed by the next prime number 59), an integer-matrix quadratic form that represents all prime numbers when it represents

15 (number) (1,071 words) [view diff] exact match in snippet view article

quadruplet (11, 13, 17, 19). If a positive definite quadratic form with integer matrix represents all positive integers up to 15, then it represents all positive

Crystallographic restriction theorem (2,474 words) [view diff] exact match in snippet view article find links to article

triangle basis is an integer matrix with order 6. Let OrdN denote the set of integers that can be the order of an N×N integer matrix. For example, Ord2

Inverse element (4,478 words) [view diff] exact match in snippet view article find links to article

an invertible matrix is a matrix that has an inverse that is also an integer matrix. Such a matrix is called a unimodular matrix for distinguishing it from

Hadamard's maximal determinant problem (2,429 words) [view diff] exact match in snippet view article find links to article

be the matrix G = RRT. From this definition it follows that G is an integer matrix, is symmetric, is positive-semidefinite, has constant diagonal whose

H-cobordism (1,914 words) [view diff] exact match in snippet view article find links to article

C_{k}} are free. Then ∂ k {\displaystyle \partial _{k}} , which is an integer matrix, restricts to an invertible morphism which can thus be diagonalized

Inoue surface (1,184 words) [view diff] exact match in snippet view article find links to article

S^{0}.} The Inoue surface of type S0 is determined by the choice of an integer matrix φ, constrained as above. There is a countable number of such surfaces

♯P-completeness of 01-permanent (4,216 words) [view diff] exact match in snippet view article find links to article

01-Permanent is #P-hard as well. Using modular arithmetic, convert an integer matrix A {\displaystyle A} into an equivalent non-negative matrix A ′ {\displaystyle

Ordered dithering (1,694 words) [view diff] exact match in snippet view article find links to article

of the map into a floating point format, rather than the traditional integer matrix format shown above. For this, the following formula can be used: Mpre(i

Integer programming (4,192 words) [view diff] exact match in snippet view article find links to article

multiple optimal solutions. Suppose A {\displaystyle A} is an m-by-n integer matrix and b {\displaystyle \mathbf {b} } is an m-by-1 integer vector. We focus

Linear subspace (4,640 words) [view diff] exact match in snippet view article find links to article

Generally, K can be any field of such characteristic that the given integer matrix has the appropriate rank in it. All fields include integers, but some

Modular form (4,651 words) [view diff] exact match in snippet view article find links to article

properties: f is meromorphic in the open upper half-plane H For every integer matrix ( a b c d ) {\displaystyle {\begin{pmatrix}a&b\\c&d\end{pmatrix}}} in

Wilson matrix (1,136 words) [view diff] exact match in snippet view article find links to article

W = Z T Z {\displaystyle W=Z^{T}Z} with Z {\displaystyle Z} as the integer matrix Z = [ 2 3 2 2 1 1 2 1 0 0 1 2 0 0 1 1 ] {\displaystyle

Conway group (2,300 words) [view diff] exact match in snippet view article find links to article

transitive on Λ2, and indeed he found a new matrix, not monomial and not an integer matrix. Let η be the 4-by-4 matrix 1 2 ( 1 − 1 − 1 − 1 − 1 1 − 1 − 1 − 1 −

Matrix multiplication algorithm (4,483 words) [view diff] exact match in snippet view article find links to article

finite abelian groups and the Hermite and Smith normal forms of an integer matrix" (PDF), SIAM Journal on Computing, 18 (4): 658–669, CiteSeerX 10.1.1

Multidimensional Multirate Systems (1,123 words) [view diff] exact match in snippet view article find links to article

version of x(n) is defined as y(n)= x(Mn), where M is a nonsingular integer matrix called decimation matrix. In the frequency domain, relation becomes

Computational complexity of matrix multiplication (4,286 words) [view diff] exact match in snippet view article find links to article

finite abelian groups and the Hermite and Smith normal forms of an integer matrix" (PDF). SIAM Journal on Computing. 18 (4): 658–669. CiteSeerX 10.1.1

Free abelian group (6,773 words) [view diff] exact match in snippet view article find links to article

as well: if M {\displaystyle M} is a d × d {\displaystyle d\times d} integer matrix with determinant ± 1 {\displaystyle \pm 1} , then the rows of M {\displaystyle

Filter bank (5,930 words) [view diff] exact match in snippet view article find links to article

while in multi-dimensional systems the decimators are D × D nonsingular integer matrix. it considers only those samples that are on the lattice generated by

Point accepted mutation (4,448 words) [view diff] exact match in snippet view article find links to article

Generalisation of property to positive integer matrix powers This generalisation can be proven using mathematical induction. Suppose that for a matrix

Multirate filter bank and multidimensional directional filter banks (4,934 words) [view diff] exact match in snippet view article find links to article

while in multi-dimensional systems the decimators are D X D nonsingular integer matrix. it considers only those samples that are on the lattice generated by