Search Results for ""

The Menger sponge is a fractal which is the three-dimensional analog of the Sierpiński carpet. The nth iteration of the Menger sponge is implemented in the Wolfram Language ...

The nth-order Menger sponge graph is the connectivity graph of cubes in the nth iteration of the Menger sponge fractal. The first two iterations are shown above. The n-Menger ...

Let G be a graph with A and B two disjoint n-tuples of graph vertices. Then either G contains n pairwise disjoint AB-paths, each connecting a point of A and a point of B, or ...

A surface given by the parametric equations x(u,v) = u (1) y(u,v) = v (2) z(u,v) = au^4+u^2v-v^2. (3)

A mensuration formula is simply a formula for computing the length-related properties of an object (such as area, circumradius, etc., of a polygon) based on other known ...

The Mephisto waltz sequence is defined by beginning with 0 and then iterating the maps 0->001 and 1->110. This gives 0, 001, 001001110, 001001110001001110110110001, ... (OEIS ...

The Mercator projection is a map projection that was widely used for navigation since loxodromes are straight lines (although great circles are curved). The following ...

The Mercator series, also called the Newton-Mercator series (Havil 2003, p. 33), is the Taylor series for the natural logarithm ln(1+x) = sum_(k=1)^(infty)((-1)^(k+1))/kx^k ...

The Meredith graph is a quartic nonhamiltonian graph on 70 nodes and 140 edges that is a counterexample to the conjecture that every 4-regular 4-connected graph is ...

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 ...