Search Results for ""

The Maclaurin-Bézout theorem says that two curves of degree n intersect in n^2 points, so two cubics intersect in nine points. This means that n(n+3)/2 points do not always ...

If a matrix group is reducible, then it is completely reducible, i.e., if the matrix group is equivalent to the matrix group in which every matrix has the reduced form ...

Mastermind is a simple two-player code-breaking board game invented in 1970 by Mordecai Meirowitz, an Israeli postmaster and telecommunications expert. It may have been ...

The power A^n of a matrix A for n a nonnegative integer is defined as the matrix product of n copies of A, A^n=A...A_()_(n). A matrix to the zeroth power is defined to be the ...

A Maurer rose is a plot of a "walk" along an n- (or 2n-) leafed rose curve in steps of a fixed number d degrees, including all cosets.

A maximal independent set is an independent set which is a maximal set, i.e., an independent set that is not a subset of any other independent set. The generic term "maximal ...

The maximal irredundance polynomial R_G(x) for the graph G may be defined as the polynomial R_G(x)=sum_(k=ir(G))^(IR(G))r_kx^k, where ir(G) is the (lower) irredundance ...

The maximal matching-generating polynomial M_G(x) for the graph G may be defined as the polynomial M_G(x)=sum_(k=nu_L(G))^(nu(G))m_kx^k, where nu_L(G) is the lower matching ...

Let T be a maximal torus of a group G, then T intersects every conjugacy class of G, i.e., every element g in G is conjugate to a suitable element in T. The theorem is due to ...

A maximum irredundant set is an irredundant set of largest possible size in a graph. Note that a maximum irredundant set is not equivalent to a maximal irredundant set, which ...