TOPICS
Search

Search Results for ""


651 - 660 of 1355 for Symmetric MatrixSearch Results
Let x=(x_1,x_2,...,x_n) and y=(y_1,y_2,...,y_n) be nonincreasing sequences of real numbers. Then x majorizes y if, for each k=1, 2, ..., n, sum_(i=1)^kx_i>=sum_(i=1)^ky_i, ...
An antisymmetric (also called alternating) tensor is a tensor which changes sign when two indices are switched. For example, a tensor A^(x_1,...,x_n) such that ...
Let j_k(alpha) denote the number of cycles of length k for a permutation alpha expressed as a product of disjoint cycles. The cycle index Z(X) of a permutation group X of ...
A univariate function f(x) is said to be even provided that f(x)=f(-x). Geometrically, such functions are symmetric about the y-axis. Examples of even functions include 1 ...
Symbols used to identify irreducible representations of groups: A= singly degenerate state which is symmetric with respect to rotation about the principal C_n axis, B= singly ...
The probability that two elements P_1 and P_2 of a symmetric group generate the entire group tends to 3/4 as n->infty (Netto 1964, p. 90). The conjecture was proven by Dixon ...
A univariate function f(x) is said to be odd provided that f(-x)=-f(x). Geometrically, such functions are symmetric about the origin. Examples of odd functions include x, ...
The Pauli matrices, also called the Pauli spin matrices, are complex matrices that arise in Pauli's treatment of spin in quantum mechanics. They are defined by sigma_1 = ...
A polynomial is a mathematical expression involving a sum of powers in one or more variables multiplied by coefficients. A polynomial in one variable (i.e., a univariate ...
A simple graph, also called a strict graph (Tutte 1998, p. 2), is an unweighted, undirected graph containing no graph loops or multiple edges (Gibbons 1985, p. 2; West 2000, ...
1 ... 63|64|65|66|67|68|69 ... 136 Previous Next

...