Search Results for ""

When a pair of non-incident edges of a tetrahedron is chosen, the midpoints of the remaining 4 edges are the vertices of a planar parallelogram. Furthermore, the area of this ...

A zonohedron which is the dual of the dodecadodecahedron U_(36) and Wenninger dual W_(73). The medial rhombic triacontahedron contains interior pentagrammic vertices which ...

1000 The medial triambic icosahedron is the dual of the ditrigonal dodecadodecahedron U_(41) and Wenninger dual W_(80), whose outward appearance is the same as the great ...

Given an original triangle (thick line), find the medial triangle (outer thin line) and its incircle. Take the pedal triangle (inner thin line) of the medial triangle with ...

The word "median" has several different meanings in mathematics all related to the "middle" of mathematical objects. The statistical median is an order statistic that gives ...

Call a graph vertex m(a,b,c) a median of a graph G if it lies on all shortest paths between each pair of vertices (a,b), (b,a), and (c,a) in G. A median graph is then defined ...

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. 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. 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.