Search Results for ""

A projection which maps a sphere (or spheroid) onto a plane. Map projections are generally classified into groups according to common properties (cylindrical vs. conical, ...

In 1803, Malfatti posed the problem of determining the three circular columns of marble of possibly different sizes which, when carved out of a right triangular prism, would ...

A Markov chain is collection of random variables {X_t} (where the index t runs through 0, 1, ...) having the property that, given the present, the future is conditionally ...

The Markov numbers m are the union of the solutions (x,y,z) to the Markov equation x^2+y^2+z^2=3xyz, (1) and are related to Lagrange numbers L_n by L_n=sqrt(9-4/(m^2)). (2) ...

A k-matching in a graph G is a set of k edges, no two of which have a vertex in common (i.e., an independent edge set of size k). Let Phi_k be the number of k-matchings of ...

The (upper) matching number nu(G) of graph G, sometimes known as the edge independence number, is the size of a maximum independent edge set. Equivalently, it is the degree ...

Mathematics is a broad-ranging field of study in which the properties and interactions of idealized objects are examined. Whereas mathematics began merely as a calculational ...

There are several regular mathematics competitions available to students. The International Mathematical Olympiad is perhaps the largest, while the William Lowell Putnam ...

(d^2V)/(dv^2)+[a-2qcos(2v)]V=0 (1) (Abramowitz and Stegun 1972; Zwillinger 1997, p. 125), having solution y=C_1C(a,q,v)+C_2S(a,q,v), (2) where C(a,q,v) and S(a,q,v) are ...

A maximal clique is a clique that cannot be extended by including one more adjacent vertex, meaning it is not a subset of a larger clique. A maximum clique (i.e., clique of ...