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 primitive subgroup of the symmetric group S_n is equal to either the alternating group A_n or S_n whenever it contains at least one permutation which is a q-cycle for some ...

The throwing and catching of multiple objects such that at least one is always in the air. Some aspects of juggling turn out to be quite mathematical. The best examples are ...

The dilogarithm identity Li_2(-x)=-Li_2(x/(1+x))-1/2[ln(1+x)]^2.

Laplace's integral is one of the following integral representations of the Legendre polynomial P_n(x), P_n(x) = 1/piint_0^pi(du)/((x+sqrt(x^2-1)cosu)^(n+1))du (1) = ...

Given a function of the form y=a+blnx, (1) the coefficients can be found from least squares fitting as b = ...

In a noncommutative ring R, a left ideal is a subset I which is an additive subgroup of R and such that for all r in R and all a in I, ra in I. A left ideal of R can be ...

Let H be a subgroup of G. A subset T of elements of G is called a left transversal of H if T contains exactly one element of each left coset of H.

An algorithm which isolates roots in the complex plane by generalizing one-dimensional bracketing.

A limb of a tree at a vertex v is the union of one or more branches at v in the tree. v is then called the base of the limb.