Search Results for ""

Let L=(L, ^ , v ) and K=(K, ^ , v ) be lattices, and let h:L->K. If h is one-to-one and onto, then it is a join-isomorphism if it preserves joins.

The composition quotient groups belonging to two composition series of a finite group G are, apart from their sequence, isomorphic in pairs. In other words, if I subset H_s ...

A nonassociative algebra named after physicist Pascual Jordan which satisfies xy=yx (1) and (xx)(xy)=x((xx)y)). (2) The latter is equivalent to the so-called Jordan identity ...

Let M be a bounded set in the plane, i.e., M is contained entirely within a rectangle. The outer Jordan measure of M is the greatest lower bound of the areas of the coverings ...

For positive integer n, the K-function is defined by K(n) = 1^12^23^3...(n-1)^(n-1) (1) = H(n-1), (2) where the numbers H(n)=K(n+1) are called hyperfactorials by Sloane and ...

An algorithm for partitioning (or clustering) N data points into K disjoint subsets S_j containing N_j data points so as to minimize the sum-of-squares criterion ...

The so-called generalized Kadomtsev-Petviashvili-Burgers equation is the partial differential equation ...

An algorithm in control theory introduced by Kalman (1960) and refined by Kalman and Bucy (1961). It is an algorithm which makes optimal use of imprecise data on a linear (or ...

Suppose x_1<x_2<...<x_n are given positive numbers. Let lambda_1, ..., lambda_n>=0 and sum_(j=1)^(n)lambda_j=1. Then ...

A Kapteyn series is a series of the form sum_(n=0)^inftyalpha_nJ_(nu+n)[(nu+n)z], (1) where J_n(z) is a Bessel function of the first kind. Examples include Kapteyn's original ...