-
1 pairwise disjoint sets
Математика: попарно непересекающиеся множестваУниверсальный англо-русский словарь > pairwise disjoint sets
-
2 disjoint
1) несовместимый; несовместный; дизъюнктный2) матем. непересекающийся3) разделять; расчленять; рассоединять4) не пересекаться; не иметь общих элементов•disjoint [disjunctive] ideal — дизъюнктный идеал
linearly disjoint extensions — линейно свободные расширения, линейно разделенные расширения
mutually disjoint [mutually exclusive] sets — непересекающиеся множества
-
3 pairwise
попарно, по двое pairwise comaximal ideals ≈ попарно комаксимальные идеалы pairwise compact spaces ≈ попарно компактные пространства pairwise complete spaces ≈ попарно полные пространства pairwise connected relation ≈ попарно связное отношение pairwise disjoint sets ≈ попарно непересекающиеся множества pairwise disjoint subsets ≈ попарно не пересекающиеся подмножества pairwise independent absolute values ≈ попарно независимые абсолютные значения pairwise independent elements ≈ попарно независимые элементы pairwise independent events ≈ попарно независимые события pairwise independent random variables ≈ попарно независимые случайные величины pairwise independent sets ≈ попарно независимые множества pairwise open cover ≈ попарно открытое покрытие pairwise orthogonal elements ≈ попарно ортогональные элементы pairwise relatively prime ideals ≈ попарно взаимно простые идеалы pairwise relatively prime numbers ≈ попарно взаимно простые числа pairwise relatively primes ≈ попарно относительно простые числа pairwise transitive group ≈ двуточечно транзитивная группа - pairwise choice - pairwise compactness - pairwise difference - pairwise disjoint - pairwise distinguishability - pairwise identification - pairwise independence - pairwise independent - pairwise interaction - pairwise orthogonality - pairwise otrhogonal - pairwise sufficiency - pairwise test - pairwise transitive парный, попарный парами, попарноБольшой англо-русский и русско-английский словарь > pairwise
См. также в других словарях:
Disjoint sets — Two disjoint sets. In mathematics, two sets are said to be disjoint if they have no element in common. For example, {1, 2, 3} and {4, 5, 6} are disjoint sets.[1] Explanation Formally, two sets A and … Wikipedia
Almost disjoint sets — In mathematics, two sets are almost disjoint if their intersection is small in some sense. Different definitions of small will therefore result in different definitions of almost disjoint . Definition The most common choice is to take small to… … Wikipedia
Disjoint union — In mathematics, the term disjoint union may refer to one of two different concepts: In set theory, a disjoint union (or discriminated union) is a modified union operation that indexes the elements according to which set they originated in;… … Wikipedia
Set packing — is a classical NP complete problem in computational complexity theory and combinatorics, and was one of Karp s 21 NP complete problems. Suppose we have a finite set S and a list of subsets of S. Then, the set packing problem asks if some k… … Wikipedia
Vitali set — In mathematics, a Vitali set is an elementary example of a set of real numbers that is not Lebesgue measurable. The Vitali theorem is the existence theorem that there are such sets. It is a non constructive result. The naming is for Giuseppe… … Wikipedia
Probability space — This article is about mathematical term. For the novel, see Probability Space (novel). In probability theory, a probability space or a probability triple is a mathematical construct that models a real world process (or experiment ) consisting of… … Wikipedia
Measure (mathematics) — Informally, a measure has the property of being monotone in the sense that if A is a subset of B, the measure of A is less than or equal to the measure of B. Furthermore, the measure of the empty set is required to be 0. In mathematical analysis … Wikipedia
Rule of sum — In combinatorics, the rule of sum is a basic counting principle. Stated simply, it is the idea that if we have a ways of doing something and b ways of doing another thing and we can not do both at the same time, then there are a + b ways to… … Wikipedia
Set cover problem — The set covering problem is a classical question in computer science and complexity theory. As input you are given several sets. They may have some elements in common. You must select a minimum number of these sets so that the sets you have… … Wikipedia
Measurable cardinal — In mathematics, a measurable cardinal is a certain kind of large cardinal number. Contents 1 Measurable 2 Real valued measurable 3 See also 4 References … Wikipedia
Probability measure — In some cases, statistical physics uses probability measures, but not all measures it uses are probability measures.[1][2] In mathematics, a probability measure is a real valued function defined on a set … Wikipedia
