Search Results for ""

An edge coloring of a graph G is a coloring of the edges of G such that adjacent edges (or the edges bounding different regions) receive different colors. An edge coloring ...

An efficient version of the Walsh transform that requires O(nlnn) operations instead of the n^2 required for a direct Walsh transform (Wolfram 2002, p. 1072).

Successive points dividing a golden rectangle into squares lie on a logarithmic spiral (Wells 1991, p. 39; Livio 2002, p. 119) which is sometimes known as the golden spiral. ...

A Hessenberg decomposition is a matrix decomposition of a matrix A into a unitary matrix P and a Hessenberg matrix H such that PHP^(H)=A, where P^(H) denotes the conjugate ...

Let X be an infinite set of urelements, and let V(^*X) be an enlargement of the superstructure V(X). Let A,B in V(X) be finitary algebras with finitely many operations, and ...

The l^2-norm (also written "l^2-norm") |x| is a vector norm defined for a complex vector x=[x_1; x_2; |; x_n] (1) by |x|=sqrt(sum_(k=1)^n|x_k|^2), (2) where |x_k| on the ...

A Laurent polynomial with coefficients in the field F is an algebraic object that is typically expressed in the form ...+a_(-n)t^(-n)+a_(-(n-1))t^(-(n-1))+... ...

A linear algebraic group is a matrix group that is also an affine variety. In particular, its elements satisfy polynomial equations. The group operations are required to be ...

A linear system of equations is a set of n linear equations in k variables (sometimes called "unknowns"). Linear systems can be represented in matrix form as the matrix ...

The term "lobster" is used to refer either to a particular polyiamond or to a class of tree called a lobster graph. When referring to polyiamonds, the lobster is the ...