Search Results for ""

For a given n, is the problem of determining if a set is mortal solvable? n=1 is solvable, n=2 is unknown, and n>=3 is unsolvable.

The very large number consisting of the number 2 inside a mega-gon.

An oval whose construction is illustrated in the above diagram.

For all x, y, a in an alternative algebra A, (xax)y = x[a(xy)] (1) y(xax) = [(yx)a]x (2) (xy)(ax) = x(ya)x (3) (Schafer 1996, p. 28).

A principal vertex x_i of a simple polygon P is called a mouth if the diagonal [x_(i-1),x_(i+1)] is an extremal diagonal (i.e., the interior of [x_(i-1),x_(i+1)] lies in the ...

A necessary and sufficient condition that [alpha^'] should be comparable with [alpha] for all positive values of the a is that one of (alpha^') and (alpha) should be ...

Multi-index notation is used to shorten expressions that contain many indices. Let x in R^n and write x=(x_1,...,x_n). A multi-index alpha is an n-tuple of integers alpha_j ...

A multilinear form on a vector space V(F) over a field F is a map f:V(F)×...×V(F)->F (1) such that c·f(u_1,...,u_i,...,u_n)=f(u_1,...,c·u_i,...,u_n) (2) and ...

Possessing more than one mode. A set of values having a single unique mode is said to be unimodal, one with two modes is called bimodal, and one with three modes is called ...

An algebraic expression containing more than one term (cf., binomial). The term is also used to refer to a polynomial.