set of numbers
121Orders of magnitude (numbers) — The logarithmic scale can compactly represent the relationship among variously sized numbers. This list contains selected positive numbers in increasing order, including counts of things, dimensionless quantity and probabilities. Each number is… …
122Rencontres numbers — In combinatorial mathematics, the rencontres numbers are a triangular array of integers that enumerate permutations of the set { 1, ..., n } with specified numbers of fixed points. ( Rencontre is French for encounter . By some accounts, the… …
123Independent set (graph theory) — The nine blue vertices form a maximum independent set for the Generalized Petersen graph GP(12,4). In graph theory, an independent set or stable set is a set of vertices in a graph, no two of which are adjacent. That is, it is a set I of vertices …
124Instruction set — An instruction set, or instruction set architecture (ISA), is the part of the computer architecture related to programming, including the native data types, instructions, registers, addressing modes, memory architecture, interrupt and exception… …
125Meagre set — In the mathematical fields of general topology and descriptive set theory, a meagre set (also called a meager set or a set of first category) is a set that, considered as a subset of a (usually larger) topological space, is in a precise sense… …
126Descriptive set theory — In mathematical logic, descriptive set theory is the study of certain classes of well behaved subsets of the real line and other Polish spaces. As well as being one of the primary areas of research in set theory, it has applications to other… …
127Von Neumann–Bernays–Gödel set theory — In the foundations of mathematics, von Neumann–Bernays–Gödel set theory (NBG) is an axiomatic set theory that is a conservative extension of the canonical axiomatic set theory ZFC. A statement in the language of ZFC is provable in NBG if and only …
128Directed set — In mathematics, a directed set (or a directed preorder or a filtered set) is a nonempty set A together with a reflexive and transitive binary relation ≤ (that is, a preorder), with the additional property that every pair of elements has an upper… …
