Search Results for ""

The word "pole" is used prominently in a number of very different branches of mathematics. Perhaps the most important and widespread usage is to denote a singularity of a ...

There are a number of equations known as the Riccati differential equation. The most common is z^2w^('')+[z^2-n(n+1)]w=0 (1) (Abramowitz and Stegun 1972, p. 445; Zwillinger ...

The simplex method is a method for solving problems in linear programming. This method, invented by George Dantzig in 1947, tests adjacent vertices of the feasible set (which ...

"The" square graphs is the cycle graph C_4. It is isomorphic to the complete bipartite graph K_(2,2). Like all cycle graphs, the line graph of C_4 is isomorphic to itself. A ...

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

The regular polygon of 17 sides is called the heptadecagon, or sometimes the heptakaidecagon. Gauss proved in 1796 (when he was 19 years old) that the heptadecagon is ...