Search Results for ""

A maze, also known as a labyrinth, as is a set of passages (with impermeable walls). The goal of the maze is to start at one given point and find a path through the passages ...

In the mice problem, also called the beetle problem, n mice start at the corners of a regular n-gon of unit side length, each heading towards its closest neighboring mouse in ...

A nonplanar graph is a graph that is not planar. The numbers of simple nonplanar graphs on n=1, 2, ... nodes are 0, 0, 0, 0, 1, 14, 222, 5380, 194815, ... (OEIS A145269), ...

The set R union {infty}, obtained by adjoining one improper element to the set R of real numbers, is the set of projectively extended real numbers. Although notation is not ...

A quaternion Kähler manifold is a Riemannian manifold of dimension 4n, n>=2, whose holonomy is, up to conjugacy, a subgroup of Sp(n)Sp(1)=Sp(n)×Sp(1)/Z_2, but is not a ...

When discussing a rotation, there are two possible conventions: rotation of the axes, and rotation of the object relative to fixed axes. In R^2, consider the matrix that ...

Rubik's Cube is a 3×3×3 cube in which the 26 subcubes on the outside are internally hinged in such a way that rotation (by a quarter turn in either direction or a half turn) ...

A simple directed graph is a directed graph having no multiple edges or graph loops (corresponding to a binary adjacency matrix with 0s on the diagonal). The number of simple ...

Let sopfr(n) be the sum of prime factors (with repetition) of a number n. For example, 20=2^2·5, so sopfr(20)=2+2+5=9. Then sopfr(n) for n=1, 2, ... is given by 0, 2, 3, 4, ...

The total number of contravariant and covariant indices of a tensor. The rank R of a tensor is independent of the number of dimensions N of the underlying space. An intuitive ...