Search Results for ""

The middle layer graph of order n is the graph whose vertex set consists of all bitstrings of length 2n+1 that have exactly n or n+1 entries equal to 1, with an edge between ...

The minimal enclosing circle problem, sometimes also known as the bomb problem, is the problem of finding the circle of smallest radius that contains a given set of points in ...

Newton's method for finding roots of a complex polynomial f entails iterating the function z-[f(z)/f^'(z)], which can be viewed as applying the Euler backward method with ...

The notion of parallel transport on a manifold M makes precise the idea of translating a vector field V along a differentiable curve to attain a new vector field V^' which is ...

The Paris-Harrington theorem is a strengthening of the finite Ramsey's theorem by requiring that the homogeneous set be large enough so that cardH>=minH. Clearly, the ...

There are at least 15 classes of convex pentagonal tilings, as illustrated above. The first five were discovered during investigations of German mathematician Karl Reinhardt ...

A prolate spheroid is a spheroid that is "pointy" instead of "squashed," i.e., one for which the polar radius c is greater than the equatorial radius a, so c>a (called ...

Quasi-Monte Carlo integration is a method of numerical integration that operates in the same way as Monte Carlo integration, but instead uses sequences of quasirandom numbers ...

A sequence of n-tuples that fills n-space more uniformly than uncorrelated random points, sometimes also called a low-discrepancy sequence. Although the ordinary uniform ...

Let G be a finite, connected, undirected graph with graph diameter d(G) and graph distance d(u,v) between vertices u and v. A radio labeling of a graph G is labeling using ...