Search Results for ""

The m×n queen graph Q_(m,n) is a graph with mn vertices in which each vertex represents a square in an m×n chessboard, and each edge corresponds to a legal move by a queen. ...

Unlike quadratic, cubic, and quartic polynomials, the general quintic cannot be solved algebraically in terms of a finite number of additions, subtractions, multiplications, ...

RSA numbers are difficult to-factor composite numbers having exactly two prime factors (i.e., so-called semiprimes) that were listed in the Factoring Challenge of RSA ...

A random number is a number chosen as if by chance from some specified distribution such that selection of a large set of these numbers reproduces the underlying ...

The resistance distance between vertices i and j of a graph G is defined as the effective resistance between the two vertices (as when a battery is attached across them) when ...

The Riemann zeta function is an extremely important special function of mathematics and physics that arises in definite integration and is intimately related with very deep ...

The Shrikhande graph is a strongly regular graph on 16 nodes. It is cospectral with the rook graph L_(4,4), so neither of the two is determined by spectrum. The Shrikhande ...

Spherical coordinates, also called spherical polar coordinates (Walton 1967, Arfken 1985), are a system of curvilinear coordinates that are natural for describing positions ...

The spherical harmonics Y_l^m(theta,phi) are the angular portion of the solution to Laplace's equation in spherical coordinates where azimuthal symmetry is not present. Some ...

The signed Stirling numbers of the first kind are variously denoted s(n,m) (Riordan 1980, Roman 1984), S_n^((m)) (Fort 1948, Abramowitz and Stegun 1972), S_n^m (Jordan 1950). ...