Search Results for ""

A star polygon {p/q}, with p,q positive integers, is a figure formed by connecting with straight lines every qth point out of p regularly spaced points lying on a ...

The Steiner tree of some subset of the vertices of a graph G is a minimum-weight connected subgraph of G that includes all the vertices. It is always a tree. Steiner trees ...

A number of attractive tetrahedron 5-compounds can be constructed. The first (left figures) is one of the icosahedron stellations in which the 5×4 vertices of the tetrahedra ...

The asymptotic form of the n-step Bernoulli distribution with parameters p and q=1-p is given by P_n(k) = (n; k)p^kq^(n-k) (1) ∼ 1/(sqrt(2pinpq))e^(-(k-np)^2/(2npq)) (2) ...

The Clebsch graph, also known as the Greenwood-Gleason graph (Read and Wilson, 1998, p. 284) and illustrated above in a number of embeddings, is a strongly regular quintic ...

The genus gamma(G) of a graph G is the minimum number of handles that must be added to the plane to embed the graph without any crossings. A graph with genus 0 is embeddable ...

11 11 1 11 2 2 11 2 4 2 11 3 6 6 3 11 3 9 10 9 3 11 4 12 19 19 12 4 11 4 16 28 38 28 16 4 11 5 20 44 66 66 44 20 5 11 5 25 60 110 126 110 60 25 5 1 (1) Losanitsch's triangle ...

A Turing machine is a theoretical computing machine invented by Alan Turing (1937) to serve as an idealized model for mathematical calculation. A Turing machine consists of a ...

The inverse cotangent is the multivalued function cot^(-1)z (Zwillinger 1995, p. 465), also denoted arccotz (Abramowitz and Stegun 1972, p. 79; Harris and Stocker 1998, p. ...

A Boolean algebra is a mathematical structure that is similar to a Boolean ring, but that is defined using the meet and join operators instead of the usual addition and ...