Search Results for ""

The icosahedral graph is the Platonic graph whose nodes have the connectivity of the regular icosahedron, as well as the great dodecahedron, great icosahedron Jessen's ...

A surface S is n-embeddable if it can be placed in R^n-space without self-intersections, but cannot be similarly placed in any R^k for k<n. A surface so embedded is said to ...

An Egyptian fraction is a sum of positive (usually) distinct unit fractions. The famous Rhind papyrus, dated to around 1650 BC contains a table of representations of 2/n as ...

A Steiner quadruple system is a Steiner system S(t=3,k=4,v), where S is a v-set and B is a collection of k-sets of S such that every t-subset of S is contained in exactly one ...

A class of complete orientable minimal surfaces of R^3 derived from Enneper's minimal surface. They are named for the mathematicians who found the first two examples in 1982. ...

A multiplication table is an array showing the result of applying a binary operator to elements of a given set S. For example, the following table is the multiplication table ...

The dodecahedral graph is the Platonic graph corresponding to the connectivity of the vertices of a dodecahedron, illustrated above in four embeddings. The left embedding ...

A random matrix is a matrix of given type and size whose entries consist of random numbers from some specified distribution. Random matrix theory is cited as one of the ...

Analytic continuation (sometimes called simply "continuation") provides a way of extending the domain over which a complex function is defined. The most common application is ...

The simplest class of one-dimensional cellular automata. Elementary cellular automata have two possible values for each cell (0 or 1), and rules that depend only on nearest ...