Search Results for ""

The partial differential equation 3/4U_y+W_x=0, (1) where W_y+U_t-1/4U_(xxx)+3/2UU_x=0 (2) (Krichever and Novikov 1980; Novikov 1999). Zwillinger (1997, p. 131) and Calogero ...

Klee's identity is the binomial sum sum_(k=0)^n(-1)^k(n; k)(n+k; m)=(-1)^n(n; m-n), where (n; k) is a binomial coefficient. For m=0, 1, ... and n=0, 1,..., the following ...

A tree with its nodes labeled. The number of labeled trees on n nodes is n^(n-2), the first few values of which are 1, 1, 3, 16, 125, 1296, ... (OEIS A000272). Cayley (1889) ...

The Legendre symbol is a number theoretic function (a/p) which is defined to be equal to +/-1 depending on whether a is a quadratic residue modulo p. The definition is ...

The MacBeath inconic of a triangle is the inconic with parameters x:y:z=a^2cosA:b^2cosB:c^2cosC. (1) Its foci are the circumcenter O and the orthocenter H, giving the center ...

A Maclaurin series is a Taylor series expansion of a function about 0, (1) Maclaurin series are named after the Scottish mathematician Colin Maclaurin. The Maclaurin series ...

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

The minimal polynomial of a matrix A is the monic polynomial in A of smallest degree n such that p(A)=sum_(i=0)^nc_iA^i=0. (1) The minimal polynomial divides any polynomial q ...

The midsphere, also called the intersphere, reciprocating sphere, or inversion sphere, is a sphere with respect to which the polyhedron vertices of a polyhedron are the ...

A minimum vertex cover is a vertex cover having the smallest possible number of vertices for a given graph. The size of a minimum vertex cover of a graph G is known as the ...