Search Results for ""

The Hamiltonian number h(n) of a connected graph G is the length of a Hamiltonian walk G. In other words, it is the minimum length of a closed spanning walk in the graph. For ...

The hypersine (n-dimensional sine function) is a function of a vertex angle of an n-dimensional parallelotope or simplex. If the content of the parallelotope is P and the ...

The Kakeya needle problems asks for the plane figure of least area in which a line segment of width 1 can be freely rotated (where translation of the segment is also ...

A lattice reduction algorithm, named after discoverers Lenstra, Lenstra, and Lovasz (1982), that produces a lattice basis of "short" vectors. It was noticed by Lenstra et al. ...

A 24-dimensional Euclidean lattice. An automorphism of the Leech lattice modulo a center of two leads to the Conway group Co_1. Stabilization of the one- and two-dimensional ...

Legendre-Gauss quadrature is a numerical integration method also called "the" Gaussian quadrature or Legendre quadrature. A Gaussian quadrature over the interval [-1,1] with ...

The terms "measure," "measurable," etc. have very precise technical definitions (usually involving sigma-algebras) that can make them appear difficult to understand. However, ...

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 noncayley graph is a graph which is not a Cayley graph. All graphs that are not vertex-transitive are noncayley graphs. However, some vertex-transitive graph are noncayley. ...

A parallelogram is a quadrilateral with opposite sides parallel (and therefore opposite angles equal). A quadrilateral with equal sides is called a rhombus, and a ...