Search Results for ""

A set of vectors is maximally linearly independent if including any other vector in the vector space would make it linearly dependent (i.e., if any other vector in the space ...

The natural norm induced by the L-infty-norm is called the maximum absolute row sum norm and is defined by ||A||_infty=max_(i)sum_(j=1)^n|a_(ij)| for a matrix A. This matrix ...

The maximum flow between vertices v_i and v_j in a graph G is exactly the weight of the smallest set of edges to disconnect G with v_i and v_j in different components (Ford ...

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

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.

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

Let a function h:U->R be continuous on an open set U subset= C. Then h is said to have the epsilon_(z_0)-property if, for each z_0 in U, there exists an epsilon_(z_0)>0 such ...

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