Search Results for ""

The proposition that every proper ideal of a Boolean algebra can be extended to a maximal ideal. It is equivalent to the Boolean representation theorem, which can be proved ...

A maximal irredundant set is an irredundant set that cannot be expanded to another irredundant set by addition of any vertex in the graph. Note that a maximal irredundant set ...

A maximally nonhamiltonian graph is a nonhamiltonian graph G for which G+e is Hamiltonian for each edge e in the graph complement of G^_, i.e., every two nonadjacent vertices ...

This problem is NP-complete (Garey and Johnson 1983).

Maximum likelihood, also called the maximum likelihood method, is the procedure of finding the value of one or more parameters for a given statistic which makes the known ...

Let U subset= C be a domain, and let f be an analytic function on U. Then if there is a point z_0 in U such that |f(z_0)|>=|f(z)| for all z in U, then f is constant. The ...

Maxwell's equations are the system of partial differential equations describing classical electromagnetism and therefore of central importance in physics. In the so-called ...

The McCarthy-91 function is the recursive function defined for positive integer n by M(n)={M(M(n+11)) for n<=100; n-10 for n>100. (1) It takes the value 91 for all n=1, 2, ...

The three circumcircles through the triangle centroid G of a given triangle DeltaA_1A_2A_3 and the pairs of the vertices of the second Brocard triangle are called the McCay ...

A subset E of a topological space S is said to be meager if E is of first category in S, i.e., if E can be written as the countable union of subsets which are nowhere dense ...