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 join-homomorphism, then it is a join-embedding.

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.

Jonquière's relation, sometimes also spelled "Joncquière's relation" (Erdélyi et al. 1981, p. 31), states ...

A Jordan curve is a plane curve which is topologically equivalent to (a homeomorphic image of) the unit circle, i.e., it is simple and closed. It is not known if every Jordan ...

Let M be a bounded set in the plane, i.e., M is contained entirely within a rectangle. The outer Jordan measure of M is the greatest lower bound of the areas of the coverings ...

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

Jordan's lemma shows the value of the integral I=int_(-infty)^inftyf(x)e^(iax)dx (1) along the infinite upper semicircle and with a>0 is 0 for "nice" functions which satisfy ...

The Jørgensen graph is a maximally linklessly embeddable graph on 8 vertices and 21 edges, where "maximal" means it is not a proper subgraph of another linklessly embeddable ...