Search Results for ""
121 - 130 of 178 for Complementary EventSearch Results
The complete elliptic integral of the second kind, illustrated above as a function of k, is defined by E(k) = E(1/2pi,k) (1) = ...
A method of computing the determinant of a square matrix due to Charles Dodgson (1866) (who is more famous under his pseudonym Lewis Carroll). The method is useful for hand ...
A complete set of mutually conjugate group elements. Each element in a group belongs to exactly one class, and the identity element (I=1) is always in its own class. The ...
A diagonal matrix is a square matrix A of the form a_(ij)=c_idelta_(ij), (1) where delta_(ij) is the Kronecker delta, c_i are constants, and i,j=1, 2, ..., n, with no implied ...
The dihedral group D_n is the symmetry group of an n-sided regular polygon for n>1. The group order of D_n is 2n. Dihedral groups D_n are non-Abelian permutation groups for ...
The minimal polynomial of a matrix A is the monic polynomial in A of smallest degree n such that p(A)=sum_(i=0)^nc_iA^i=0. (1) The minimal polynomial divides any polynomial q ...
The Mellin transform is the integral transform defined by phi(z) = int_0^inftyt^(z-1)f(t)dt (1) f(t) = 1/(2pii)int_(c-iinfty)^(c+iinfty)t^(-z)phi(z)dz. (2) It is implemented ...
The term "parameter" is used in a number of ways in mathematics. In general, mathematical functions may have a number of arguments. Arguments that are typically varied when ...
The low-level language of topology, which is not really considered a separate "branch" of topology. Point-set topology, also called set-theoretic topology or general ...
A vertex cut, also called a vertex cut set or separating set (West 2000, p. 148), of a connected graph G is a subset of the vertex set S subset= V(G) such that G-S has more ...
...
View search results from all Wolfram sites (3035 matches)

