Search Results for ""

A Gröbner basis G for a system of polynomials A is an equivalence system that possesses useful properties, for example, that another polynomial f is a combination of those in ...

Given a matrix A, its QR-decomposition is a matrix decomposition of the form A=QR, where R is an upper triangular matrix and Q is an orthogonal matrix, i.e., one satisfying ...

The finite simple groups of Lie-type. They include four families of linear simple groups: PSL(n,q) (the projective special linear group), PSU(n,q) (the projective special ...

A bounded linear operator T in B(H) on a Hilbert space H is said to be cyclic if there exists some vector v in H for which the set of orbits ...

A search algorithm of a tree that explores the first child of a node before visiting its siblings. Tarjan (1972) and Hopcroft and Tarjan (1973) showed that depth-first search ...

A finitely generated discontinuous group of linear fractional transformations z->(az+b)/(cz+d) acting on a domain in the complex plane. The Apollonian gasket corresponds to a ...

Given a linear code C of length n and dimension k over the field F, a parity check matrix H of C is a n×(n-k) matrix whose rows generate the orthogonal complement of C, i.e., ...

If M^n is a finite simplicial complex of dimension n>=5 that has the homotopy type of the sphere S^n and is locally piecewise linearly homeomorphic to the Euclidean space ...

A constant, sometimes also called a "mathematical constant," is any well-defined real number which is significantly interesting in some way. In this work, the term "constant" ...

The n functions f_1(x), f_2(x), ..., f_n(x) are linearly dependent if, for some c_1, c_2, ..., c_n in R not all zero, sum_(i=1)^nc_if_i(x)=0 (1) for all x in some interval I. ...