Search Results for ""

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 generalization of the product rule for expressing arbitrary-order derivatives of products of functions, where (n; k) is a binomial coefficient. This can also be written ...

Lemoine-Brocard geometry is that part of triangle geometry concerned with the Brocard points, Brocard triangles, etc. and with symmedians and symmedian points.

A member of a collection of sets is said to be maximal if it cannot be expanded to another member by addition of any element. Maximal sets are important in graph theory since ...

For an infinite population with mean mu, variance sigma^2, skewness gamma_1, and kurtosis excess gamma_2, the corresponding quantities for the distribution of means are ...

Let (X,A,mu) and (Y,B,nu) be measure spaces. A measurable rectangle is a set of the form A×B for A in A and B in B.

A set-like object in which order is ignored, but multiplicity is explicitly significant. Therefore, multisets {1,2,3} and {2,1,3} are equivalent, but {1,1,2,3} and {1,2,3} ...

The number of nonassociative n-products with k elements preceding the rightmost left parameter is F(n,k) = F(n-1,k)+F(n-1,k-1) (1) = (n+k-2; k)-(n+k-1; k-1), (2) where (n; k) ...

The number of nondecreasing lists {a_1,a_2,...,a_n} consisting of n elements 1<=a_i<=k is given by the binomial coefficient N(n,k)=(n+k-1; n-1). For example, there are six ...