Search Results for ""

Given a map f:S->T between sets S and T, the map g:T->S is called a left inverse to f provided that g degreesf=id_S, that is, composing f with g from the left gives the ...

A linear algebraic group is a matrix group that is also an affine variety. In particular, its elements satisfy polynomial equations. The group operations are required to be ...

A linear extension of a partially ordered set P is a permutation of the elements p_1, p_2, ... of P such that p_i<p_j implies i<j. For example, the linear extensions of the ...

A local ring is a ring R that contains a single maximal ideal. In this case, the Jacobson radical equals this maximal ideal. One property of a local ring R is that the subset ...

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

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

The Lorentz group is the group L of time-preserving linear isometries of Minkowski space R^((3,1)) with the Minkowski metric dtau^2=-(dx^0)^2+(dx^1)^2+(dx^2)^2+(dx^3)^2 ...

For a polynomial P(x_1,x_2,...,x_k), the Mahler measure of P is defined by (1) Using Jensen's formula, it can be shown that for P(x)=aproduct_(i=1)^(n)(x-alpha_i), ...

The Markström graph is a cubic planar graph on 24 vertices which lacks cycles of length 4 and 8 but contains cycles of length 16. (In particular, it contains cycles of ...