| 11. | With variables, a simple rule is required : parallel processes can only update disjoint sets of variables.
|
| 12. | Of A into a finite number of disjoint sets, for all A in \ mathcal { F }.
|
| 13. | More formally, the sum of the sizes of two disjoint sets is equal to the size of their union.
|
| 14. | The set of those translates partitions the circle into a countable collection of disjoint sets, which are all pairwise congruent.
|
| 15. | This cannot be true for two disjoint sets . talk ) 14 : 58, 31 January 2011 ( UTC)
|
| 16. | Events of this kind would not be modeled as disjoint sets in probability space as they are here in mass assignment space.
|
| 17. | In other words, spatially close sets are not disjoint sets, since they always have at least one element in common.
|
| 18. | Again, the disjoint set elements are vertices and the set represent sets of neighbors, so the algorithm takes linear time.
|
| 19. | The partitions that obey this more restrictive definition are the transversal matroids of the family of disjoint sets given by their blocks.
|
| 20. | The fundamental assumption is that a countably infinite sequence of disjoint sets satisfies the sum formula, a property called ?-additivity.
|
