Search Results for ""

An algorithm for finding a graph's spanning tree of minimum length. It sorts the edges of a graph in order of increasing cost and then repeatedly adds edges that bridge ...

A pseudoforest is an undirected graph in which every connected component contains at most one graph cycle. A pseudotree is therefore a connected pseudoforest and a forest ...

An angle bracket is the combination of a bra and ket (bra+ket = bracket) which represents the inner product of two functions or vectors (or 1-forms), <f|g>=intf(x)g^|(x)dx in ...

The wreathed product of the monster group by Z_2. The bimonster is a quotient of the Coxeter group with the above Coxeter-Dynkin diagram. This had been conjectured by Conway, ...

The fitting subgroup is the subgroup generated by all normal nilpotent subgroups of a group H, denoted F(H). In the case of a finite group, the subgroup generated will itself ...

An element a of a ring which is nonzero, not a unit, and whose only divisors are the trivial ones (i.e., the units and the products ua, where u is a unit). Equivalently, an ...

Let Omega be a space with measure mu>=0, and let Phi(P,Q) be a real function on the product space Omega×Omega. When (mu,nu) = intintPhi(P,Q)dmu(Q)dnu(P) (1) = ...

The odd part Od(n) of a positive integer n is defined by Od(n)=n/(2^(b(n))), where b(n) is the exponent of the exact power of 2 dividing n. Od(n) is therefore the product of ...

The Pell constant is the infinite product P = 1-product_(k=0)^(infty)(1-1/(2^(2k+1))) (1) = 1-(1/2;1/4)_infty (2) = 0.58057755820489... (3) (OEIS A141848), where (a,q)_infty ...

Let the true value of a quantity be x and the measured or inferred value x_0. Then the relative error is defined by deltax=(Deltax)/x=(x_0-x)/x=(x_0)/x-1, where Deltax is the ...