Search Results for ""
1981 - 1990 of 3570 for Matrix Tree TheoremSearch Results
The axioms formulated by Hausdorff (1919) for his concept of a topological space. These axioms describe the properties satisfied by subsets of elements x in a neighborhood ...
The inverse erf function is the inverse function erfc^(-1)(z) of erfc(x) such that erfc(erfc^(-1)(x))=erfc^(-1)(erfc(x)), (1) with the first identity holding for 0<x<2 and ...
Inverse function integration is an indefinite integration technique. While simple, it is an interesting application of integration by parts. If f and f^(-1) are inverses of ...
The inverse haversine function hav^(-1)(z) is defined by hav^(-1)(z)=2sin^(-1)(sqrt(z)). (1) The inverse haversine is implemented in the Wolfram Language as ...
The Radon inverse transform is an integral transform that has found widespread application in the reconstruction of images from medical CT scans. The Radon and inverse Radon ...
Denoted zn(u,k) or Z(u). Z(phi|m)=E(phi|m)-(E(m)F(phi|m))/(K(m)), where phi is the Jacobi amplitude, m is the parameter, and F(phi|m) and K(m) are elliptic integrals of the ...
Let L=(L, ^ , v ) and K=(K, ^ , v ) be lattices, and let h:L->K. If h is one-to-one and is a join-homomorphism, then it is a join-embedding.
Let L=(L, ^ , v ) and K=(K, ^ , v ) be lattices, and let h:L->K. If K=L and h is a join-homomorphism, then we call h a join-endomorphism.
Let L=(L, ^ , v ) and K=(K, ^ , v ) be lattices, and let h:L->K. Then the mapping h is a join-homomorphism provided that for any x,y in L, h(x v y)=h(x) v h(y). It is also ...
Let L=(L, ^ , v ) and K=(K, ^ , v ) be lattices, and let h:L->K. If h is one-to-one and onto, then it is a join-isomorphism if it preserves joins.
...
View search results from all Wolfram sites (23765 matches)

