Search Results for ""
1881 - 1890 of 2557 for Complement Set,Search Results

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.
Perhaps the most commonly-studied oriented point lattice is the so-called north-east lattice which orients each edge of L in the direction of increasing coordinate-value. ...
The word "order" is used in a number of different ways in mathematics. Most commonly, it refers to the number of elements in (e.g., conjugacy class order, graph order, group ...
A lattice L is said to be oriented if there exists a rule which assigns a specified direction to any edge connecting arbitrary lattice points x_i,x_j in L. In that way, an ...
For a permutation alpha in the symmetric group S_p, the alpha-permutation graph of a labeled graph G is the graph union of two disjoint copies of G (say, G_1 and G_2), ...
Given a subset S subset R^n and a real function f which is Gâteaux differentiable at a point x in S, f is said to be pseudoconvex at x if del f(x)·(y-x)>=0,y in ...
The Steenrod algebra has to do with the cohomology operations in singular cohomology with integer mod 2 coefficients. For every n in Z and i in {0,1,2,3,...} there are ...

...