Search Results for ""

The line segment connecting opposite polyhedron vertices (i.e., two polyhedron vertices which do not share a common face) in a parallelepiped or other similar solid. Also ...

A method for computing an Egyptian fraction. This method always terminates (Beeckmans 1993).

Let A be a C^*-algebra, then a state is a positive linear functional on A of norm 1.

The Stiefel manifold of orthonormal k-frames in R^n is the collection of vectors (v_1, ..., v_k) where v_i is in R^n for all i, and the k-tuple (v_1, ..., v_k) is ...

Stochastic optimization refers to the minimization (or maximization) of a function in the presence of randomness in the optimization process. The randomness may be present as ...

X subset= R^n is subanalytic if, for all x in R^n, there is an open set U and a bounded semianalytic set Y subset R^(n+m) such that X intersection U is the projection of Y ...

Two integers (m,n) form a super unitary amicable pair if sigma^*(sigma^*(m))=sigma^*(sigma^*(n))=m+n, where sigma^*(n) is the unitary divisor function. The first few pairs ...

Let f be a function defined on a set A and taking values in a set B. Then f is said to be a surjection (or surjective map) if, for any b in B, there exists an a in A for ...

A symmetric graph is a graph that is both edge- and vertex-transitive (Holton and Sheehan 1993, p. 209). However, care must be taken with this definition since arc-transitive ...

When a Young tableau is constructed using the so-called insertion algorithm, an element starts in some position on the first row, from which it may later be bumped. In ...