Search Results for ""

The numbers H_n=H_n(0), where H_n(x) is a Hermite polynomial, may be called Hermite numbers. For n=0, 1, ..., the first few are 1, 0, -2, 0, 12, 0, -120, 0, 1680, 0, ... ...

The hexanacci numbers are a generalization of the Fibonacci numbers defined by H_0=0, H_1=1, H_2=1, H_3=2, H_4=4, H_5=8, and the recurrence relation ...

A point where a stable and an unstable separatrix (invariant manifold) from the same fixed point or same family intersect. Therefore, the limits lim_(k->infty)f^k(X) and ...

Given two topological spaces M and N, place an equivalence relationship on the continuous maps f:M->N using homotopies, and write f_1∼f_2 if f_1 is homotopic to f_2. Roughly ...

There are a number of formulas variously known as Hurwitz's formula. The first is zeta(1-s,a)=(Gamma(s))/((2pi)^s)[e^(-piis/2)F(a,s)+e^(piis/2)F(-a,s)], where zeta(z,a) is a ...

The illustrations above show a number of hyperbolic tilings, including the heptagonal once related to the Klein quartic. Escher was fond of depicting hyperbolic tilings, ...

The hypercube is a generalization of a 3-cube to n dimensions, also called an n-cube or measure polytope. It is a regular polytope with mutually perpendicular sides, and is ...

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 quartic symmetric graph on 30 nodes and 60 edges corresponding to the skeleton of the Archimdean icosidodecahedron, great dodecahemidodecahedron, great icosidodecahedron, ...

An independent edge set (also called a matching) of a graph G is a subset of the edges such that no two edges in the subset share a vertex of G (Skiena 1990, p. 219). The ...