Search Results for ""

The graph complement of a perfect graph is itself perfect. Originally known as the weak perfect graph conjecture (Fulkerson 1971), the result was subsequently proved by ...

The operator of fractional integration is defined as _aD_t^(-nu)f(t)=1/(Gamma(nu))int_a^tf(u)(t-u)^(nu-1)du for nu>0 with _aD_t^0f(t)=f(t) (Oldham and Spanier 1974, Miller ...

A usually simple algorithm or identity. The term is frequently applied to specific orders of Newton-Cotes formulas. The designation "rule n" is also given to the nth ...

For a given point lattice, some number of points will be within distance d of the origin. A Waterman polyhedron is the convex hull of these points. A progression of Waterman ...

The biggest little polygon with n sides is the convex plane n-gon of unit polygon diameter having largest possible area. Reinhardt (1922) showed that for n odd, the regular ...

Rule 150 is one of the elementary cellular automaton rules introduced by Stephen Wolfram in 1983 (Wolfram 1983, 2002). It specifies the next color in a cell, depending on its ...

Rule 60 is one of the elementary cellular automaton rules introduced by Stephen Wolfram in 1983 (Wolfram 1983, 2002). It specifies the next color in a cell, depending on its ...

Rule 94 is one of the elementary cellular automaton rules introduced by Stephen Wolfram in 1983 (Wolfram 1983, 2002). It specifies the next color in a cell, depending on its ...

A causal network is an acyclic digraph arising from an evolution of a substitution system, and representing its history. The illustration above shows a causal network ...

The hundred-dollar, hundred-digits challenge problems are a set of ten problems in numerical analysis published in the January/February 2002 issue of SIAM News ...