Search Results for ""

The Icosian game, also called the Hamiltonian game (Ball and Coxeter 1987, p. 262), is the problem of finding a Hamiltonian cycle along the edges of an dodecahedron, i.e., a ...

A regularly spaced array of points in a square array, i.e., points with coordinates (m,n,...), where m, n, ... are integers. Such an array is often called a grid or mesh, and ...

An irreducible representation of a group is a group representation that has no nontrivial invariant subspaces. For example, the orthogonal group O(n) has an irreducible ...

The numerical value of Khinchin's constant K is given by K=2.685452001... (OEIS A002210). However, the numerical value of K is notoriously difficult to calculate to high ...

The Klein bottle crossing number of a graph G is the minimum number of crossings possible when embedding G on a Klein bottle (cf. Garnder 1986, pp. 137-138). While the ...

Let omega_1 and omega_2 be periods of a doubly periodic function, with tau=omega_2/omega_1 the half-period ratio a number with I[tau]!=0. Then Klein's absolute invariant ...

The Laplacian for a scalar function phi is a scalar differential operator defined by (1) where the h_i are the scale factors of the coordinate system (Weinberg 1972, p. 109; ...

The process of finding a reduced set of basis vectors for a given lattice having certain special properties. Lattice reduction algorithms are used in a number of modern ...

The nth root of the denominator B_n of the nth convergent A_n/B_n of a number x tends to a constant lim_(n->infty)B_n^(1/n) = e^beta (1) = e^(pi^2/(12ln2)) (2) = 3.275823... ...

The Lucas-Lehmer test is an efficient deterministic primality test for determining if a Mersenne number M_n is prime. Since it is known that Mersenne numbers can only be ...