Search Results for ""

A convex polyomino (sometimes called a "convex polygon") is a polyomino whose perimeter is equal to that of its minimal bounding box (Bousquet-Mélou et al. 1999). ...

A point lattice is a regularly spaced array of points. In the plane, point lattices can be constructed having unit cells in the shape of a square, rectangle, hexagon, etc. ...

Probability and Statistics

An important result in valuation theory which gives information on finding roots of polynomials. Hensel's lemma is formally stated as follows. Let (K,|·|) be a complete ...

Self-recursion is a recursion that is defined in terms of itself, resulting in an ill-defined infinite regress. The formula for the volume of a cylinder leads to the ...

The Pappus graph is a cubic symmetric distance-regular graph on 18 vertices, illustrated above in three embeddings. It is Hamiltonian and can be represented in LCF notation ...

The norm of a mathematical object is a quantity that in some (possibly abstract) sense describes the length, size, or extent of the object. Norms exist for complex numbers ...

While the pedal point, Cevian point, and even pedal-Cevian point are commonly used concepts in triangle geometry, there seems to be no established term to describe the ...

The 120-cell is a finite regular four-dimensional polytope with Schläfli symbol {5,3,3}. It is also known as the hyperdodecahedron or hecatonicosachoron, and is composed of ...

A group G is a finite or infinite set of elements together with a binary operation (called the group operation) that together satisfy the four fundamental properties of ...