“DISJOINT” на російській мові

Divergence scores were averaged over consecutive disjoint sets of 15 genes each to smooth the curves.

A matching in a graph is a set of disjoint edges (i.e no two sharing an endpoint) connecting pairs of vertices, and a maximum matching is a matching of maximum size.

Remember how when comparing two hyperreal numbers we form three disjoint sets: the agreement set, and two order relation sets.

The order of a permutation is the least common multiple of the lengths in the decomposition into disjoint cycles.

If there are an even number of people in the circle, this breaks the analysis into two disjoint groups, each of which must stabilize (but not necessarily to the same number).