disjoint
101Decomposition of spectrum (functional analysis) — In mathematics, especially functional analysis, the spectrum of an operator generalizes the notion of eigenvalues. Given an operator, it is sometimes useful to break up the spectrum into various parts. This article discusses a few examples of… …
102List of mathematics articles (D) — NOTOC D D distribution D module D D Agostino s K squared test D Alembert Euler condition D Alembert operator D Alembert s formula D Alembert s paradox D Alembert s principle Dagger category Dagger compact category Dagger symmetric monoidal… …
103Set 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… …
104Carathéodory's extension theorem — See also Carathéodory s theorem for other meanings. In measure theory, Carathéodory s extension theorem proves that for a given set Ω, you can always extend a sigma; finite measure defined on R to the sigma; algebra generated by R , where R is a… …
105Extension topology — In topology, a branch of mathematics, an extension topology is a topology placed on the disjoint union of a topological space and another set. There are various types of extension topology, described in the sections below. Contents 1 Extension… …
106Hopcroft–Karp algorithm — The Hopcroft–Karp algorithm finds maximum cardinality matchings in bipartite graphs in O(sqrt{V} E) time, where V is the number of vertices and E is the number of edges of the graph. [John E. Hopcroft, Richard M. Karp: An n^{5/2} Algorithm for… …
107Circle packing theorem — Example of the circle packing theorem on K5, the complete graph on five vertices, minus one edge. The circle packing theorem (also known as the Koebe–Andreev–Thurston theorem) describes the possible tangency relations between circles in the plane …
108Hausdorff space — /hows dawrf, howz /, Math. a topological space in which each pair of points can be separated by two disjoint open sets containing the points. [named after Felix Hausdorff (1868 1942), German mathematician, who first described it] * * * ▪… …
109probability theory — Math., Statistics. the theory of analyzing and making statements concerning the probability of the occurrence of uncertain events. Cf. probability (def. 4). [1830 40] * * * Branch of mathematics that deals with analysis of random events.… …
110Covering 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 …
