TOPICS
Search

Search Results for ""


1 - 10 of 113 for meetSearch Results
In a lattice, any two elements a and b have a greatest lower bound. This greatest lower bound is often called the meet of a and b, and is denoted by a ^ b. One can also speak ...
Let L=(L, ^ , v ) and K=(K, ^ , v ) be lattices, and let h:L->K. A meet-endomorphism of L is a meet-homomorphism from L to L.
Let L=(L, ^ , v ) and K=(K, ^ , v ) be lattices, and let h:L->K. If h is one-to-one and is a meet-homomorphism, then h is a meet-embedding.
Let L=(L, ^ , v ) and K=(K, ^ , v ) be lattices, and let h:L->K. Then the mapping h is a meet-homomorphism if h(x ^ y)=h(x) ^ h(y). It is also said that "h preserves meets."
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 meet-isomorphism provided that it preserves meets.
A point at which two polygon edges of a polygon meet.
The vertex of a polytope is a point where edges of the polytope meet.
A point at which two noncrossing branches of a curve meet with different tangents.
A line segment where two faces of a polyhedron meet, also called a side.
A point at which three or more polyhedron edges of a polyhedron meet. The concept can also be generalized to a polytope.
1|2|3|4 ... 12 Next

...