Search Results for ""

There are essentially three types of Fisher-Tippett extreme value distributions. The most common is the type I distribution, which are sometimes referred to as Gumbel types ...

The Franklin graph is the 12-vertex cubic graph shown above whose embedding on the Klein bottle divides it into regions having a minimal coloring using six colors, thus ...

An invertible knot is a knot that can be deformed via an ambient isotopy into itself but with the orientation reversed. A knot that is not invertible is said to be ...

Find the plane lamina of least area A which is capable of covering any plane figure of unit generalized diameter. A unit circle is too small, but a hexagon circumscribed on ...

The (m,n)-lollipop graph is the graph obtained by joining a complete graph K_m to a path graph P_n with a bridge. Precomputed properties of lollipop graphs are available in ...

The R graph is the graph on 6 vertices illustrated above. It is implemented in the Wolfram Language as GraphData["RGraph"].

The Riemann tensor (Schutz 1985) R^alpha_(betagammadelta), also known the Riemann-Christoffel curvature tensor (Weinberg 1972, p. 133; Arfken 1985, p. 123) or Riemann ...

Rule 102 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 110 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 90 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 ...