Search Results for ""

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 so-called reaching algorithm can solve the shortest path problem (i.e., the problem of finding the graph geodesic between two given nodes) on an m-edge graph in O(m) ...

By analogy with the squircle, a term first apparently used by Fernández Guasti et al. (2005), the term "rectellipse" (used here for the first time) is a natural ...

The term rectification is sometimes used to refer to the determination of the length of a curve. Rectification also refers to the operation which converts the midpoints of ...

An auxiliary latitude which gives a sphere having correct distances along the meridians. It is denoted mu (or omega) and is given by mu=(piM)/(2M_p). (1) M_p is evaluated for ...

A set S of integers is said to be recursive if there is a total recursive function f(x) such that f(x)=1 for x in S and f(x)=0 for x not in S. Any recursive set is also ...

The quotient space K^__1A=K_1A/{0,[-1]} of the Whitehead group K_1A is known as the reduced Whitehead group. Here, the element [-1] in K_1A denotes the order-2 element ...

A square n×n matrix A=a_(ij) is called reducible if the indices 1, 2, ..., n can be divided into two disjoint nonempty sets i_1, i_2, ..., i_mu and j_1, j_2, ..., j_nu (with ...

A method of proof which proceeds by stating a proposition and then showing that it results in a contradiction, thus demonstrating the proposition to be false. In the words of ...

A strict order > on the set of terms of a term rewriting system is called a reduction order if 1. The set of terms is well ordered with respect to >, that is, all its ...