- pairwise disjoint
- мат. попарно непересекающийся
Большой англо-русский и русско-английский словарь. 2001.
pairwise disjoint
Смотреть что такое "pairwise disjoint" в других словарях:
Pairwise — may refer to: * Pairwise deletion * Pairwise disjoint * Pairwise independent * PAIRwise Paper Authorship Integrity Research an open source software to detect plagiarism * Pairwise comparison, the process of comparing two entities to determine… … Wikipedia
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
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
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
Glossary of graph theory — Graph theory is a growing area in mathematical research, and has a large specialized vocabulary. Some authors use the same word with different meanings. Some authors use different words to mean the same thing. This page attempts to keep up with… … 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
Quantum logic — In mathematical physics and quantum mechanics, quantum logic is a set of rules for reasoning about propositions which takes the principles of quantum theory into account. This research area and its name originated in the 1936 paper by Garrett… … Wikipedia
Axiom of choice — This article is about the mathematical concept. For the band named after it, see Axiom of Choice (band). In mathematics, the axiom of choice, or AC, is an axiom of set theory stating that for every family of nonempty sets there exists a family of … Wikipedia
Covering problem of Rado — The covering problem of Rado is an unsolved problem in geometry concerning covering planar sets by squares. It was formulated in 1928 by Tibor Radó and has been generalized to more general shapes and higher dimensions by Richard Rado. Formulation … 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
Combinatorial species — In combinatorial mathematics, the theory of combinatorial species is an abstract, systematic method for analysing discrete structures in terms of generating functions. Examples of discrete structures are (finite) graphs, permutations, trees, and… … Wikipedia
