Search Results for ""

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

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

A matrix, also called a canonical box matrix, having zeros everywhere except along the diagonal and superdiagonal, with each element of the diagonal consisting of a single ...

The Jørgensen graph is a maximally linklessly embeddable graph on 8 vertices and 21 edges, where "maximal" means it is not a proper subgraph of another linklessly embeddable ...

There are several conflicting meanings associated with the notation lgx. In German and Russian literature, the notation lgx is used to mean the common logarithm log_(10)x. ...

A minimal surface that contains lemniscates as geodesics which is given by the parametric equations x = R[sqrt(2)cos(1/3zeta)sqrt(cos(2/3zeta))] (1) y = ...

The Ljubljana graph is a graph on 112 vertices that is the third smallest cubic semisymmetric graph. It was discovered by Brouwer et al. (1993) and rediscovered by Conder et ...

A lobster graph, lobster tree, or simply "lobster," is a tree having the property that the removal of leaf nodes leaves a caterpillar graph (Gallian 2007). The numbers of ...

The local McLaughlin graph is the graph on 162 vertices and 4536 edges obtained from the McLaughlin graph by vertex deletion of a single vertex and its neighbors, making it ...