Search Results for ""

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

Partial evaluation is a branch of computer science studying program transformation via specialization. Any function can be specialized by fixing one or more of its inputs to ...

Given a Hilbert space H, a *-subalgebra A of B(H) is said to be a von Neumann algebra in H provided that A is equal to its bicommutant A^('') (Dixmier 1981). Here, B(H) ...

The Lyapunov characteristic exponent [LCE] gives the rate of exponential divergence from perturbed initial conditions. To examine the behavior of an orbit around a point ...

Let G be a planar graph whose vertices have been properly colored and suppose v in V(G) is colored C_1. Define the C_1C_2-Kempe chain containing v to be the maximal connected ...

The Bombieri p-norm of a polynomial Q(x)=sum_(i=0)^na_ix^i (1) is defined by [Q]_p=[sum_(i=0)^n(n; i)^(1-p)|a_i|^p]^(1/p), (2) where (n; i) is a binomial coefficient. The ...

An embedding of a 1-sphere in a 3-manifold which exists continuously over the 2-disk also extends over the disk as an embedding. An alternate phrasing is that if a knot group ...

A metatheorem stating that every theorem on partially ordered sets remains true if all inequalities are reversed. In this operation, supremum must be replaced by infimum, ...

The central binomial coefficient (2n; n) is never squarefree for n>4. This was proved true for all sufficiently large n by Sárkőzy's theorem. Goetgheluck (1988) proved the ...

Given a number field K, there exists a unique maximal unramified Abelian extension L of K which contains all other unramified Abelian extensions of K. This finite field ...