Search Results for ""

The König-Egeváry theorem, sometimes simply called König's theorem, asserts that the matching number (i.e., size of a maximum independent edge set) is equal to the vertex ...

The sequence generated by the Levine-O'Sullivan greedy algorithm: 1, 2, 4, 6, 9, 12, 15, 18, 21, 24, 28, 32, 36, 40, 45, 50, 55, 60, 65, ... (OEIS A014011). The reciprocal ...

The set of left cosets of a subgroup H of a topological group G forms a topological space. Its topology is defined by the quotient topology from pi:G->G/H. Namely, the open ...

Linnik's constant L is the constant appearing in Linnik's theorem. Heath-Brown (1992) has shown that L<=5.5, and Schinzel, Sierpiński, and Kanold (Ribenboim 1989) have ...

Tiling of a Möbius strip can be performed immediately by carrying over a tiling of a rectangle with the same two-sided surface area. However, additional tilings are possible ...

A monoid is a set that is closed under an associative binary operation and has an identity element I in S such that for all a in S, Ia=aI=a. Note that unlike a group, its ...

The Nauru graph is the name given by Eppstein (2007) to the generalized Petersen graph GP(12,5) on 24 nodes and 36 edges which is also cubic symmetric graph F_(024)A, the ...

A graph or directed graph together with a function which assigns a positive real number to each edge (Harary 1994, p. 52).

The set of numbers generated by excluding the sums of two or more consecutive earlier members is called the prime numbers of measurement, or sometimes the segmented numbers. ...

Let a discrete distribution have probability function p_k, and let a second discrete distribution have probability function q_k. Then the relative entropy of p with respect ...