Search Results for ""

A real-valued function g defined on a convex subset C subset R^n is said to be quasi-convex if for all real alpha in R, the set {x in C:g(x)<alpha} is convex. This is ...

Given a series of positive terms u_i and a sequence of positive constants {a_i}, use Kummer's test rho^'=lim_(n->infty)(a_n(u_n)/(u_(n+1))-a_(n+1)) (1) with a_n=n, giving ...

A random permutation is a permutation containing a fixed number n of a random selection from a given set of elements. There are two main algorithms for constructing random ...

A random variable is a measurable function from a probability space (S,S,P) into a measurable space (S^',S^') known as the state space (Doob 1996). Papoulis (1984, p. 88) ...

Let u_k be a series with positive terms and suppose rho=lim_(k->infty)(u_(k+1))/(u_k). Then 1. If rho<1, the series converges. 2. If rho>1 or rho=infty, the series diverges. ...

The Rayleigh functions sigma_n(nu) for n=1, 2, ..., are defined as sigma_n(nu)=sum_(k=1)^inftyj_(nu,k)^(-2n), where +/-j_(nu,k) are the zeros of the Bessel function of the ...

The rectilinear crossing number of a graph G is the minimum number of crossings in a straight line embedding of G in a plane. It is variously denoted rcr(G), cr^_(G) ...

A Redheffer matrix is a square (0,1)-matrix with elements a_(ij) equal to 1 if j=1 or i|j (i divides j), and 0 otherwise. For n=1, 2, ..., the first few Redheffer matrices ...

The binary quadratic form F=<a,b,c> is said to be reduced if the following conditions hold. Let D=b^2-4ac be the discriminant, then 1. If D is negative, F is reduced if ...

Given a module M over a commutative unit ring R and a filtration F:... subset= I_2 subset= I_1 subset= I_0=R (1) of ideals of R, the Rees module of M with respect to F is ...