Search Results for ""

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.

The study of the inner structure of a mathematical theory considered as a whole. It deals with the general properties of the rules according to which the objects of a certain ...

A vector space V with a ring structure and a vector norm such that for all v,W in V, ||vw||<=||v||||w||. If V has a multiplicative identity 1, it is also required that ...

The pathwidth of a graph G, also called the interval thickness, vertex separation number, and node searching number, is one less than the size of the largest set in a path ...

Bubbles can meet only at angles of 120 degrees (for three bubbles) and cos^(-1)(-1/3) approx 109 degrees28^'16^('') (for four bubbles), where cos^(-1)(-1/3) is the ...

For the rational curve of an unperturbed system with rotation number r/s under a map T (for which every point is a fixed point of T^s), only an even number of fixed points ...