Search Results for ""

A line graph L(G) (also called an adjoint, conjugate, covering, derivative, derived, edge, edge-to-vertex dual, interchange, representative, or theta-obrazom graph) of a ...

There are no fewer than three distinct notions of the term local C^*-algebra used throughout functional analysis. A normed algebra A=(A,|·|_A) is said to be a local ...

A field which is complete with respect to a discrete valuation is called a local field if its field of residue classes is finite. The Hasse principle is one of the chief ...

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

The longest path problem asks to find a path of maximum length in a given graph. The problem is NP-complete, but there exists an efficient dynamic programming solution for ...

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

This problem is NP-complete (Garey and Johnson 1983).

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.