Search Results for ""

The partial order width of a set P is equal to the minimum number of chains needed to cover P. Equivalently, if a set P of ab+1 elements is partially ordered, then P contains ...

A surface of constant negative curvature obtained by twisting a pseudosphere and given by the parametric equations x = acosusinv (1) y = asinusinv (2) z = ...

The Haferman carpet is the beautiful fractal constructed using string rewriting beginning with a cell [1] and iterating the rules {0->[1 1 1; 1 1 1; 1 1 1],1->[0 1 0; 1 0 1; ...

Given a circular table of diameter 9 feet, which is the minimal number of planks (each 1 foot wide and length greater than 9 feet) needed in order to completely cover the ...

The Kuen surface is a special case of Enneper's negative curvature surfaces which can be given parametrically by x = (2(cosu+usinu)sinv)/(1+u^2sin^2v) (1) = ...

The area of a surface or lamina is the amount of material needed to "cover" it completely. The area of a surface or collection of surfaces bounding a solid is called, not ...

The probability P(a,n) that n random arcs of angular size a cover the circumference of a circle completely (for a circle with unit circumference) is ...

The Fibonacci number F_(n+1) gives the number of ways for 2×1 dominoes to cover a 2×n checkerboard, as illustrated in the diagrams above (Dickau). The numbers of domino ...

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 ...

A well-covered graph is a graph for which every minimal vertex cover has the same size, which is equivalent to every maximal independent vertex set being the same size. It is ...