TOPICS
Search

Search Results for ""


321 - 330 of 481 for Ternary treeSearch Results
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.
If mu is a real measure (i.e., a measure that takes on real values), then one can decompose it according to where it is positive and negative. The positive variation is ...
An irregular dodecagonal cross in the shape of a dagger |. The six faces of a cube can be cut along seven edges and unfolded into a Latin cross (i.e., the Latin cross is the ...
A lattice automorphism is a lattice endomorphism that is also a lattice isomorphism.
Let L=(L, ^ , v ) and K=(K, ^ , v ) be lattices, and let h:L->K. A lattice endomorphism is a mapping h:L->L that preserves both meets and joins.
Let L=(L, ^ , v ) and K=(K, ^ , v ) be lattices, and let h:L->K. A lattice isomorphism is a one-to-one and onto lattice homomorphism.
Let L=(L, ^ , v ) be a lattice, and let f,g:L->L. Then the pair (f,g) is a polarity of L if and only if f is a decreasing join-endomorphism and g is an increasing ...
Let L=(L, ^ , v ) be a lattice, and let tau subset= L^2. Then tau is a tolerance if and only if it is a reflexive and symmetric sublattice of L^2. Tolerances of lattices, ...
1 ... 30|31|32|33|34|35|36 ... 49 Previous Next

...