Search Results for ""

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.

A Meyniel graph, also called a very strongly perfect graph, is a graph in which every odd cycle of length five or more has at least two chords. Meyniel graphs are perfect. ...

An n-fold multimagic cube is a magic cube that remains magic when each element is squared, cubed, etc., up to nth power. (Of course, when the elements of a cube are taken to ...

A multiplicative number theoretic function is a number theoretic function f that has the property f(mn)=f(m)f(n) (1) for all pairs of relatively prime positive integers m and ...

The functions theta_s(u) = (H(u))/(H^'(0)) (1) theta_d(u) = (Theta(u+K))/(Theta(k)) (2) theta_c(u) = (H(u))/(H(K)) (3) theta_n(u) = (Theta(u))/(Theta(0)), (4) where H(u) and ...

Let J_nu(z) be a Bessel function of the first kind, Y_nu(z) a Bessel function of the second kind, and K_nu(z) a modified Bessel function of the first kind. Then ...

The term "null graph" is used both to refer to any empty graph and to the empty graph on 0 nodes. Because of the conflicting usage, it is probably best to avoid use of the ...