TOPICS
Search

Search Results for ""


1491 - 1500 of 13135 for Boolean AlgebraSearch Results
A doubly stochastic matrix is a matrix A=(a_(ij)) such that a_(ij)>=0 and sum_(i)a_(ij)=sum_(j)a_(ij)=1 is some field for all i and j. In other words, both the matrix itself ...
The Gershgorin circle theorem (where "Gershgorin" is sometimes also spelled "Gersgorin" or "Gerschgorin") identifies a region in the complex plane that contains all the ...
The Jordan matrix decomposition is the decomposition of a square matrix M into the form M=SJS^(-1), (1) where M and J are similar matrices, J is a matrix of Jordan canonical ...
The most general form of Lagrange's group theorem, also known as Lagrange's lemma, states that for a group G, a subgroup H of G, and a subgroup K of H, (G:K)=(G:H)(H:K), ...
A Lie group is a smooth manifold obeying the group properties and that satisfies the additional condition that the group operations are differentiable. This definition is ...
A linear transformation between two vector spaces V and W is a map T:V->W such that the following hold: 1. T(v_1+v_2)=T(v_1)+T(v_2) for any vectors v_1 and v_2 in V, and 2. ...
The trace of an n×n square matrix A is defined to be Tr(A)=sum_(i=1)^na_(ii), (1) i.e., the sum of the diagonal elements. The matrix trace is implemented in the Wolfram ...
A monomial is a product of positive integer powers of a fixed set of variables (possibly) together with a coefficient, e.g., x, 3xy^2, or -2x^2y^3z. A monomial can also be ...
The scalar triple product of three vectors A, B, and C is denoted [A,B,C] and defined by [A,B,C] = A·(BxC) (1) = B·(CxA) (2) = C·(AxB) (3) = det(ABC) (4) = |A_1 A_2 A_3; B_1 ...
Serre's problem, also called Serre's conjecture, asserts that the implication "free module ==> projective module" can be reversed for every module over the polynomial ring ...
1 ... 147|148|149|150|151|152|153 ... 1314 Previous Next

...