Search Results for ""

The lower central series of a Lie algebra g is the sequence of subalgebras recursively defined by g_(k+1)=[g,g_k], (1) with g_0=g. The sequence of subspaces is always ...

The n functions f_1(x), f_2(x), ..., f_n(x) are linearly dependent if, for some c_1, c_2, ..., c_n in R not all zero, sum_(i=1)^nc_if_i(x)=0 (1) for all x in some interval I. ...

A linklessly embeddable graph is a graph having the property that there exists an embedding in three dimensions that does not contain a nontrivial link. A graph is linklessly ...

The term "lobster" is used to refer either to a particular polyiamond or to a class of tree called a lobster graph. When referring to polyiamonds, the lobster is the ...

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

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

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

The Lommel polynomials R_(m,nu)(z) arise from the equation J_(m+nu)(z)=J_nu(z)R_(m,nu)(z)-J_(nu-1)(z)R_(m-1,nu+1)(z), (1) where J_nu(z) is a Bessel function of the first kind ...

A set of n magic circles is a numbering of the intersections of the n circles such that the sum over all intersections is the same constant for all circles. The above sets of ...

The matrix tree theorem, also called Kirchhoff's matrix-tree theorem (Buekenhout and Parker 1998), states that the number of nonidentical spanning trees of a graph G is equal ...