Search Results for ""

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

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

The mean tetrahedron volume V^_ is the average volume of a tetrahedron in tetrahedron picking within some given shape. As summarized in the following table, it is possible to ...

Let (X,A,mu) and (Y,B,nu) be measure spaces. A measurable rectangle is a set of the form A×B for A in A and B in B.

If F is a sigma-algebra and A is a subset of X, then A is called measurable if A is a member of F. X need not have, a priori, a topological structure. Even if it does, there ...

A Boolean sigma-algebra which possesses a measure.