Search Results for ""

Let L=(L, ^ , v ) be a lattice, and let f,g:L->L. Then the pair (f,g) is a polarity of L if and only if f is a decreasing join-endomorphism and g is an increasing ...

Let L=(L, ^ , v ) be a lattice, and let tau subset= L^2. Then tau is a tolerance if and only if it is a reflexive and symmetric sublattice of L^2. Tolerances of lattices, ...

The Lebesgue integral is defined in terms of upper and lower bounds using the Lebesgue measure of a set. It uses a Lebesgue sum S_n=sum_(i)eta_imu(E_i) where eta_i is the ...

A minimal surface that contains lemniscates as geodesics which is given by the parametric equations x = R[sqrt(2)cos(1/3zeta)sqrt(cos(2/3zeta))] (1) y = ...

The limaçon trisectrix is a trisectrix that is a special case of the rose curve with n=1/3 (possibly with translation, rotation, and scaling). It was studied by Archimedes, ...

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