Search Results for ""

A merge sort (or collation sort) is the combination of two or more ordered lists into a single ordered list (Knuth 1998, p. 158). Merge sorting was one of the first methods ...

The metric dimension beta(G) (Tillquist et al. 2021) or dim(G) (Tomescu and Javid 2007, Ali et al. 2016) of a graph G is the smallest number of nodes required to identify all ...

The midsphere, also called the intersphere, reciprocating sphere, or inversion sphere, is a sphere with respect to which the polyhedron vertices of a polyhedron are the ...

Miller's rules, originally devised to restrict the number of icosahedron stellations to avoid, for example, the occurrence of models that appear identical but have different ...

A minimal cover is a cover for which removal of any single member destroys the covering property. For example, of the five covers of {1,2}, namely {{1},{2}}, {{1,2}}, ...

Minkowski's conjecture states that every lattice tiling of R^n by unit hypercubes contains two hypercubes that meet in an (n-1)-dimensional face. Minkowski first considered ...

If a points A^', B^', and C^' are marked on each side of a triangle DeltaABC, one on each side (or on a side's extension), then the three Miquel circles (each through a ...

Define q=e^(2piitau) (cf. the usual nome), where tau is in the upper half-plane. Then the modular discriminant is defined by ...

The modular equation of degree n gives an algebraic connection of the form (K^'(l))/(K(l))=n(K^'(k))/(K(k)) (1) between the transcendental complete elliptic integrals of the ...

A function is said to be modular (or "elliptic modular") if it satisfies: 1. f is meromorphic in the upper half-plane H, 2. f(Atau)=f(tau) for every matrix A in the modular ...