Search Results for ""

In a lattice, any two elements a and b have a least upper bound. This least upper bound is often called the join of a and b, and is denoted by a v b. One can also speak of ...

A lattice embedding is a one-to-one lattice homomorphism.

The least common denominator of a collection of fractions (p_1)/(q_1),...,(p_n)/(q_n) is the least common multiple LCM(q_1,...,q_n) of their denominators.

A simple root of a Lie algebra is a positive root that is not the sum of two positive roots.

The infinitesimal algebraic object associated with a Lie groupoid. A Lie algebroid over a manifold B is a vector bundle A over B with a Lie algebra structure [,] (Lie ...

The commutation operation [a,b]=ab-ba corresponding to the Lie product.

The multiplication operation corresponding to the Lie bracket.

The degree of a graph vertex of a graph is the number of graph edges which touch the graph vertex, also called the local degree. The graph vertex degree of a point A in a ...

Let G=(V,E) be a (not necessarily simple) undirected edge-weighted graph with nonnegative weights. A cut C of G is any nontrivial subset of V, and the weight of the cut is ...

The maximal independence polynomial I_G(x) for the graph G may be defined as the polynomial I_G(x)=sum_(k=i(G))^(alpha(G))s_kx^k, where i(G) is the lower independence number, ...