Search Results for ""

Let L be a lattice (or a bounded lattice or a complemented lattice, etc.), and let C_L be the covering relation of L: C_L={(x,y) in L^2|x covers y or y covers x}. Then C_L is ...

A lattice L is locally subbounded if and only if each of its finite subsets is contained in a finitely generated bounded sublattice of L. Every locally bounded lattice is ...

A locus is the set of all points (usually forming a curve or surface) satisfying some condition. For example, the locus of points in the plane equidistant from a given point ...

By analogy with the log sine function, define the log cosine function by C_n=int_0^(pi/2)[ln(cosx)]^ndx. (1) The first few cases are given by C_1 = -1/2piln2 (2) C_2 = ...

The logarithmic capacity of a compact set E in the complex plane is given by gamma(E)=e^(-V(E)), (1) where V(E)=inf_(nu)int_(E×E)ln1/(|u-v|)dnu(u)dnu(v), (2) and nu runs over ...

For a logarithmic spiral given parametrically as x = ae^(bt)cost (1) y = ae^(bt)sint, (2) evolute is given by x_e = -abe^(bt)sint (3) y_e = abe^(bt)cost. (4) As first shown ...

The continuous distribution with parameters m and b>0 having probability and distribution functions P(x) = (e^(-(x-m)/b))/(b[1+e^(-(x-m)/b)]^2) (1) D(x) = 1/(1+e^(-(x-m)/b)) ...

The Lommel differential equation is a generalization of the Bessel differential equation given by z^2y^('')+zy^'+(z^2-nu^2)y=kz^(mu+1), (1) or, in the most general form, by ...

An infinite sequence of homomorphisms of modules or additive Abelian groups ...->C_(i+1)->^(d_(i+1))C_i->^(d_i)C_(i-1)->... (1) such that, for all indices i in Z, ...

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