Search Results for ""

Lovász (1970) conjectured that every connected vertex-transitive graph is traceable (Gould, p. 33). This conjecture was subsequently verified for several special orders and ...

Nonstandard analysis is a branch of mathematical logic which introduces hyperreal numbers to allow for the existence of "genuine infinitesimals," which are numbers that are ...

Numerical integration is the approximate computation of an integral using numerical techniques. The numerical computation of an integral is sometimes called quadrature. ...

Let lambda_(m,n) be Chebyshev constants. Schönhage (1973) proved that lim_(n->infty)(lambda_(0,n))^(1/n)=1/3. (1) It was conjectured that the number ...

Operations research is a vast branch of mathematics which encompasses many diverse areas of minimization and optimization. Thousands of books have been written worldwide on ...

In common usage, an ordinal number is an adjective which describes the numerical position of an object, e.g., first, second, third, etc. In formal set theory, an ordinal ...

Orthogonal polynomials are classes of polynomials {p_n(x)} defined over a range [a,b] that obey an orthogonality relation int_a^bw(x)p_m(x)p_n(x)dx=delta_(mn)c_n, (1) where ...

An out-shuffle, also known as a perfect shuffle (Golomb 1961), is a riffle shuffle in which the top half of the deck is placed in the right hand, and cards are then ...

There are six Painlevé transcendents, corresponding to second-order ordinary differential equations whose only movable singularities are ordinary poles and which cannot be ...

A pairing function is a function that reversibly maps Z^*×Z^* onto Z^*, where Z^*={0,1,2,...} denotes nonnegative integers. Pairing functions arise naturally in the ...