Search Results for ""

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

A random-connection model (RCM) is a graph-theoretic model of continuum percolation theory characterized by the existence of a stationary point process X and a non-increasing ...

A recurrence equation (also called a difference equation) is the discrete analog of a differential equation. A difference equation involves an integer function f(n) in a form ...

The uniform polyhedra are polyhedra consisting of regular (possibly polygrammic) faces of equal edge length whose polyhedron vertices are all symmetrically equivalent. The ...

The Biggs-Smith graph is cubic symmetric graph F_(102)A on 102 vertices and 153 edges that is also distance-regular with intersection array {3,2,2,2,1,1,1;1,1,1,1,1,1,3} and ...

Any two rectilinear figures with equal area can be dissected into a finite number of pieces to form each other. This is the Wallace-Bolyai-Gerwien theorem. For minimal ...

The generalized hypergeometric function is given by a hypergeometric series, i.e., a series for which the ratio of successive terms can be written ...

The Hermite polynomials H_n(x) are set of orthogonal polynomials over the domain (-infty,infty) with weighting function e^(-x^2), illustrated above for n=1, 2, 3, and 4. ...

The hundred-dollar, hundred-digits challenge problems are a set of ten problems in numerical analysis published in the January/February 2002 issue of SIAM News ...

Let x=[a_0;a_1,...]=a_0+1/(a_1+1/(a_2+1/(a_3+...))) (1) be the simple continued fraction of a "generic" real number x, where the numbers a_i are the partial denominator. ...