Search Results for ""

The minimum leaf number ml(G) of a connected graph G is the smallest number of tree leaves in any of its spanning trees. (The corresponding largest number of leaves is known ...

The Minkowski measure of a bounded, closed set is the same as its Lebesgue measure.

The statistical index P_M=(sump_nq_a)/(sump_0q_a), where p_n is the price per unit in period n and q_n is the quantity produced in period n.

A quartic surface named after its resemblance to the liturgical headdress worn by bishops and given by the equation 4x^2(x^2+y^2+z^2)-y^2(1-y^2-z^2)=0.

A mixed graph in which both directed and undirected edges may exist. If only directed edges exist, the graph is called a directed graph. If only undirected edges exist, it is ...

A partial derivative of second or greater order with respect to two or more different variables, for example f_(xy)=(partial^2f)/(partialxpartialy). If the mixed partial ...

A collection of moves together with a corresponding set of weights which are followed probabilistically in the playing of a game. The minimax theorem of game theory states ...

Spherical triangles into which a sphere is divided by the planes of symmetry of a uniform polyhedron.

The partial differential equation (Cole and Cook 1986, p. 34; Zwillinger 1997, p. 134).

A well ordered set of monomials which also satisfies the condition "u<v implies uw<vw" for all monomials u, v, and w. Examples of monomial orders are the lexicographic order ...