Search Results for ""

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 ...

The group of all nonsingular n×n stochastic matrices over a field F. It is denoted S(n,F). If p is prime and F is the finite field of order q=p^m, S(n,q) is written instead ...

An extension field of a field F that is not algebraic over F, i.e., an extension field that has at least one element that is transcendental over F. For example, the field of ...

The trimean is defined to be TM=1/4(H_1+2M+H_2), where H_i are the hinges and M is the statistical median. Press et al. (1992) call this Tukey's trimean. It is an L-estimate.

A witness is a number which, as a result of its number theoretic properties, guarantees either the compositeness or primality of a number n. Witnesses are most commonly used ...

On an algebraic curve, the sum of the number of coincidences at a noncuspidal point C is the sum of the orders of the infinitesimal distances from a nearby point P to the ...

A solution zeta_k=e^(2piik/d) to the cyclotomic equation x^d=1. The de Moivre numbers give the coordinates in the complex plane of the polygon vertices of a regular polygon ...

The logistic equation (sometimes called the Verhulst model or logistic growth curve) is a model of population growth first published by Pierre Verhulst (1845, 1847). The ...

(1) for p in [-1/2,1/2], where delta is the central difference and S_(2n+1) = 1/2(p+n; 2n+1) (2) S_(2n+2) = p/(2n+2)(p+n; 2n+1), (3) with (n; k) a binomial coefficient.

A problem posed by L. Collatz in 1937, also called the 3x+1 mapping, 3n+1 problem, Hasse's algorithm, Kakutani's problem, Syracuse algorithm, Syracuse problem, Thwaites ...