Search Results for ""
481 - 490 of 798 for np completeSearch Results
Let P be a class of (universal) algebras. Then an algebra A is a local P-algebra provided that every finitely generated subalgebra F of A is a member of the class P. Note ...
If a group of men and women may date only if they have previously been introduced, then a complete set of dates is possible iff every subset of men has collectively been ...
All Mathieu functions have the form e^(irz)f(z), where f(z) has period 2pi and r is known as the Mathieu characteristic exponent. This exponent is returned by the Wolfram ...
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.
1. Find a complete system of invariants, or 2. Decide when two metrics differ only by a coordinate transformation. The most common statement of the problem is, "Given metrics ...
A metric space is a set S with a global distance function (the metric g) that, for every two points x,y in S, gives the distance between them as a nonnegative real number ...
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. ...
...
View search results from all Wolfram sites (9122 matches)

