Search Results for ""

For a braid with M strands, R components, P positive crossings, and N negative crossings, {P-N<=U_++M-R if P>=N; P-N<=U_-+M-R if P<=N, (1) where U_+/- are the smallest number ...

A transposition graph G_n is a graph whose nodes correspond to permutations and edges to permutations that differ by exactly one transposition (Skiena 1990, p. 9, Clark ...

A tripod is a tree having exactly three tree leaves (Pirnazar and Ullman 2002). The numbers of tripods on n=1, 2, ... vertices are 0, 0, 0, 1, 1, 2, 3, 4, 5, 7, 8, 10, 12, ...

The truncated pentakis dodecahedron is a polyhedron on 180 vertices, 270 edges, and 92 faces. Its canonical polyhedron has edges of three different lengths and faces ...

The series z=ln(e^xe^y) (1) for noncommuting variables x and y. The first few terms are z_1 = x+y (2) z_2 = 1/2(xy-yx) (3) z_3 = 1/(12)(x^2y+xy^2-2xyx+y^2x+yx^2-2yxy) (4) z_4 ...

Intuitively, a model of d-dimensional percolation theory is said to be a Bernoulli model if the open/closed status of an area is completely random. In particular, it makes ...

A board is a subset of the polygons determined by a number of (usually regularly spaced and oriented) lines. These polygons form the spaces on which "pieces" can be placed ...

The contact triangle of a triangle DeltaABC, also called the intouch triangle, is the triangle DeltaC_AC_BC_C formed by the points of tangency of the incircle of DeltaABC ...

Consider an arbitrary one-dimensional map x_(n+1)=F(x_n) (1) (with implicit parameter r) at the onset of chaos. After a suitable rescaling, the Feigenbaum function ...

A class of illusion in which an object which is physically unrealizable is apparently depicted. More than 100 papers have been written about impossible figures (Kulpa 1987), ...