Search Results for ""

The path covering number (or path-covering number; Slater 1972) of a graph G, variously denoted as summarized below, is the minimum number of vertex-disjoint paths that cover ...

The Seidel-Entringer-Arnold triangle is the number triangle consisting of the Entringer numbers E_(n,k) arranged in "ox-plowing" order, ...

A correction which must be applied to the measured moments m_k obtained from normally distributed data which have been binned in order to obtain correct estimators mu^^_i for ...

A Vandermonde matrix is a type of matrix that arises in the polynomial least squares fitting, Lagrange interpolating polynomials (Hoffman and Kunze p. 114), and the ...

The Biggs-Smith graph is cubic symmetric graph F_(102)A on 102 vertices and 153 edges that is also distance-regular with intersection array {3,2,2,2,1,1,1;1,1,1,1,1,1,3} and ...

The dihedral group D_4 is one of the two non-Abelian groups of the five groups total of group order 8. It is sometimes called the octic group. An example of D_4 is the ...

The randomization of a deck of cards by repeated interleaving. More generally, a shuffle is a rearrangement of the elements in an ordered list. Shuffling by exactly ...

A sutured manifold is a tool in geometric topology which was first introduced by David Gabai in order to study taut foliations on 3-manifolds. Roughly, a sutured manifold is ...

Let V be a real symmetric matrix of large order N having random elements v_(ij) that for i<=j are independently distributed with equal densities, equal second moments m^2, ...

The shortest circular sequence of length sigma^n such that every string of length n on the alphabet a of size sigma occurs as a contiguous subrange of the sequence described ...