disjoint closures
1Parovicenko space — In mathematics, a Parovicenko space is a space similar to the space of non isolated points of the Stone Cech compactification of the integers.DefinitionA Parovicenko space is a topological space X satisfying the following conditions: * X is… …
2Separated sets — In topology and related branches of mathematics, separated sets are pairs of subsets of a given topological space that are related to each other in a certain way.The notion of when two sets are separated or not is important both to the notion of… …
3Glossary of topology — This is a glossary of some terms used in the branch of mathematics known as topology. Although there is no absolute distinction between different areas of topology, the focus here is on general topology. The following definitions are also… …
4Separation axiom — In topology and related fields of mathematics, there are several restrictions that one often makes on the kinds of topological spaces that one wishes to consider. Some of these restrictions are given by the separation axioms. These are sometimes… …
5Sigma additivity — In mathematics, additivity and sigma additivity of a function defined on subsets of a given set are abstractions of the intuitive properties of size (length, area, volume) of a set. Contents 1 Additive (or finitely additive) set functions 2 σ… …
6Axiom 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 …
7Tagged union — In computer science, a tagged union, also called a variant, variant record, discriminated union , or disjoint union, is a data structure used to hold a value that could take on several different, but fixed types. Only one of the types can be in… …
8Kazhdan–Lusztig polynomial — In representation theory, a Kazhdan–Lusztig polynomial P y,w ( q ) is a member of a family of integral polynomials introduced in work of David Kazhdan and George Lusztig Harv|Kazhdan|Lusztig|1979. They are indexed by pairs of elements y , w of a… …
9Order theory — For a topical guide to this subject, see Outline of order theory. Order theory is a branch of mathematics which investigates our intuitive notion of order using binary relations. It provides a formal framework for describing statements such as… …
10Closure problem — A Closure problem is a problem in graph theory for finding a set of vertices in a directed graph such that there are no edges from the set to the rest of the graph. More specifically, the minimum closure problem asks for a set of this type with… …
- 1
- 2
