Search Results for ""

The direct product of the rings R_gamma, for gamma some index set I, is the set product_(gamma in I)R_gamma={f:I-> union _(gamma in I)R_gamma|f(gamma) in R_gamma all gamma in ...

A graph G whose line graph is L(G) is called the root graph R(L(G)) of L(G). In order words, R(L(G))=G. The root graph of a connected graph is unique except for K_3=C_3 (the ...

Given a sequence of values {a_k}_(k=1)^n, the running maxima are the sequence of values {max(a_1,...,a_k)}_(k=1)^n. So, for example, given a sequence (3,5,7,8,8,5,7,9,2,5), ...

An algebra with no nontrivial nilpotent ideals. In the 1890s, Cartan, Frobenius, and Molien independently proved that any finite-dimensional semisimple algebra over the real ...

Let H be a two-dimensional distribution function with marginal distribution functions F and G. Then there exists a copula C such that H(x,y)=C(F(x),G(y)). Conversely, for any ...

Let H be a Hilbert space, B(H) the set of bounded linear operators from H to itself, T an operator on H, and sigma(T) the operator spectrum of T. Then if T in B(H) and T is ...

Possessing a single unique mode. The term unimodal distribution, which refers to a distribution having a single local maximum is a slight corruption of this definition.

In general, there is no unique matrix solution A to the matrix equation y=Ax. Even in the case of y parallel to x, there are still multiple matrices that perform this ...

A polyhedron is said to be canonical if all its polyhedron edges touch a sphere and the center of gravity of their contact points is the center of that sphere. In other ...

Ore (1962) noted that not only does a tree possesses a unique shortest path between any two vertices, but that there also exist also other connected graphs having the same ...