Search Results for ""

A split graph is a graph whose vertices can be partitioned into a clique and an independent vertex set. Equivalently, it is a chordal graph whose graph complement is also ...

There are at least two distinct notions of when a point process is stationary. The most commonly utilized terminology is as follows: Intuitively, a point process X defined on ...

An intrinsic property of a mathematical object which causes it to remain invariant under certain classes of transformations (such as rotation, reflection, inversion, or more ...

A region in a knot or link projection plane surrounded by a circle such that the knot or link crosses the circle exactly four times. Two tangles are equivalent if a sequence ...

A vertex cut, also called a vertex cut set or separating set (West 2000, p. 148), of a connected graph G is a subset of the vertex set S subset= V(G) such that G-S has more ...

The weak law of large numbers (cf. the strong law of large numbers) is a result in probability theory also known as Bernoulli's theorem. Let X_1, ..., X_n be a sequence of ...

A sequence {x_1,x_2,...} is equidistributed iff lim_(N->infty)1/Nsum_(n<N)e^(2piimx_n)=0 for each m=1, 2, .... A consequence of this result is that the sequence {frac(nx)} is ...

Given a Hilbert space H, a *-subalgebra A of B(H) is said to be a von Neumann algebra in H provided that A is equal to its bicommutant A^('') (Dixmier 1981). Here, B(H) ...

The von Staudt-Clausen theorem, sometimes also known as the Staudt-Clausen theorem (Carlitz 1968), states that B_(2n)=A_n-sum_(p_k; (p_k-1)|2n)1/(p_k), (1) where B_(2n) is a ...

A term in social choice theory meaning invariance of a result under permutation of voters.