Wigner semicircle distributionThe Wigner semicircle distribution, named after the physicist Eugene Wigner, is the probability distribution on [−R, R] whose probability density function f is a scaled semicircle (i.e., a semi-ellipse) centered at (0, 0): for −R ≤ x ≤ R, and f(x) = 0 if |x| > R. The parameter R is commonly referred to as the "radius" parameter of the distribution. The Wigner distribution also coincides with a scaled beta distribution. That is, if Y is a beta-distributed random variable with parameters α = β = 3/2, then the random variable X = 2RY – R exhibits a Wigner semicircle distribution with radius R.
Dobiński's formulaIn combinatorial mathematics, Dobiński's formula states that the n-th Bell number Bn (i.e., the number of partitions of a set of size n) equals where denotes Euler's number. The formula is named after G. Dobiński, who published it in 1877. In the setting of probability theory, Dobiński's formula represents the nth moment of the Poisson distribution with mean 1. Sometimes Dobiński's formula is stated as saying that the number of partitions of a set of size n equals the nth moment of that distribution.
Disjoint setsIn mathematics, two sets are said to be disjoint sets if they have no element in common. Equivalently, two disjoint sets are sets whose intersection is the empty set. For example, {1, 2, 3} and {4, 5, 6} are disjoint sets, while {1, 2, 3} and {3, 4, 5} are not disjoint. A collection of two or more sets is called disjoint if any two distinct sets of the collection are disjoint. This definition of disjoint sets can be extended to families of sets and to indexed families of sets.
Intersection (set theory)In set theory, the intersection of two sets and denoted by is the set containing all elements of that also belong to or equivalently, all elements of that also belong to Intersection is written using the symbol "" between the terms; that is, in infix notation. For example: The intersection of more than two sets (generalized intersection) can be written as: which is similar to capital-sigma notation. For an explanation of the symbols used in this article, refer to the table of mathematical symbols.
MatroidIn combinatorics, a branch of mathematics, a matroid ˈmeɪtrɔɪd is a structure that abstracts and generalizes the notion of linear independence in vector spaces. There are many equivalent ways to define a matroid axiomatically, the most significant being in terms of: independent sets; bases or circuits; rank functions; closure operators; and closed sets or flats. In the language of partially ordered sets, a finite simple matroid is equivalent to a geometric lattice.
Disjoint unionIn mathematics, a disjoint union (or discriminated union) of a family of sets is a set often denoted by with an injection of each into such that the of these injections form a partition of (that is, each element of belongs to exactly one of these images). A disjoint union of a family of pairwise disjoint sets is their union. In , the disjoint union is the coproduct of the , and thus defined up to a bijection. In this context, the notation is often used. The disjoint union of two sets and is written with infix notation as .
