Search Results for ""

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

A maximum likelihood estimator is a value of the parameter a such that the likelihood function is a maximum (Harris and Stocket 1998, p. 824).

The maximum degree, sometimes simply called the maximum degree, of a graph G is the largest vertex degree of G, denoted Delta.

For every infinite loop space machine E, there is a natural equivalence of spectra between EX and Segal's spectrum BX.

Simple majority vote is the only procedure which is anonymous, dual, and monotonic.

The generalization of the Schönflies theorem to n dimensions. A smoothly embedded n-hypersphere in an (n+1)-hypersphere separates the (n+1)-hypersphere into two components, ...

The radical circle of the McCay circles has center (1) which is not a Kimberling center, and radius (2) where (3) Its circle function is (4) where (5) which is also does not ...

If two square n×n matrices A and B are simultaneously upper triangularizable by similarity transforms, then there is an ordering a_1, ..., a_n of the eigenvalues of A and ...

The mean clustering coefficient of a graph G is the average of the local clustering coefficients of G. It is implemented in the Wolfram Language as ...

For an infinite population with mean mu, variance sigma^2, skewness gamma_1, and kurtosis excess gamma_2, the corresponding quantities for the distribution of means are ...