Search Results for ""
1921 - 1930 of 13134 for decoherence theorySearch Results
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 ...
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 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 ...
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.
A measure space is a measurable space possessing a nonnegative measure. Examples of measure spaces include n-dimensional Euclidean space with Lebesgue measure and the unit ...
A set of points capable of being enclosed in intervals whose total length is arbitrarily small.
Given a Farey sequence with consecutive terms h/k and h^'/k^', then the mediant is defined as the reduced form of the fraction (h+h^')/(k+k^').
A Meeussen sequence is an increasing sequence of positive integers (m_1, m_2, ...) such that m_1=1, every nonnegative integer is the sum of a subset of the {m_i}, and each ...
...