Search Results for ""

The Mandart circle is the circumcircle of the extouch triangle. It has center at Kimberling center X_(1158), which has trilinear center function (1) and radius ...

Markov's theorem states that equivalent braids expressing the same link are mutually related by successive applications of two types of Markov moves. Markov's theorem is ...

Nonhomogeneous matrix equations of the form Ax=b (1) can be solved by taking the matrix inverse to obtain x=A^(-1)b. (2) This equation will have a nontrivial solution iff the ...

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

The Maxwell (or Maxwell-Boltzmann) distribution gives the distribution of speeds of molecules in thermal equilibrium as given by statistical mechanics. Defining a=sqrt(kT/m), ...

The McLaughlin group is the sporadic group McL of order |McL| = 898128000 (1) = 2^7·3^6·5^3·7·11. (2) It is implemented in the Wolfram Language as McLaughlinGroupMcL[].

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

Call a graph vertex m(a,b,c) a median of a graph G if it lies on all shortest paths between each pair of vertices (a,b), (b,a), and (c,a) in G. A median graph is then defined ...

A modification of Legendre's formula for the prime counting function pi(x). It starts with |_x_| = (1) where |_x_| is the floor function, P_2(x,a) is the number of integers ...

Let G be a graph with A and B two disjoint n-tuples of graph vertices. Then either G contains n pairwise disjoint AB-paths, each connecting a point of A and a point of B, or ...