Search Results for ""

A simple path is a path which is a simple curve. More precisely, a continuous mapping gamma:[a,b]->C^0 is a simple path if it has no self-intersections. Here, C^0 denotes the ...

The anti-self-dual Yang-Mills equation is the system of partial differential equations ...

PEMDAS is an acronym used primarily in the United States as a mechanism to pedagogically enforce the order rules of computational precedence. PEMDAS is explained as follows: ...

The term "rhombicosidodecahedron" is most commonly used (e.g., Wenninger 1989, p. 28; Maeder 1997. Model 27) to refer to the 62-faced Archimedean solid with faces ...

A self-avoiding polygon containing three corners of its minimal bounding rectangle. The anisotropic area and perimeter generating function G(x,y) and partial generating ...

A self-organizing data structure which uses rotations to move any accessed key to the root. This leaves recently accessed nodes near the top of the tree, making them very ...

The metric of Felix Klein's model for hyperbolic geometry, g_(11) = (a^2(1-x_2^2))/((1-x_1^2-x_2^2)^2) (1) g_(12) = (a^2x_1x_2)/((1-x_1^2-x_2^2)^2) (2) g_(22) = ...

The cube-connected cycle graph of order n is the graph obtained by replacing each vertex in a n-dimensional hypercube by a cycle of length n. They were introduced by ...

A concave polygon is a polygon that is not convex. A simple polygon is concave iff at least one of its internal angles is greater than 180 degrees. An example of a non-simple ...

A self-avoiding walk in which steps may be to the left, right, or straight ahead after a vertical step, but only straight ahead or to the left after a horizontal step. A ...