Search Results for ""

An inequality which implies the correctness of the Robertson conjecture (Milin 1964). de Branges (1985) proved this conjecture, which led to the proof of the full Bieberbach ...

Several cylindrical equidistant projections were devised by R. Miller. Miller's projections have standard parallels of phi_1=37 degrees30^' (giving minimal overall scale ...

In French and German usage, one milliard equals 10^9=1000000000. American usage does not have a number called the milliard, instead using the term billion to denote 10^9. ...

Let X be a locally convex topological vector space and let K be a compact subset of X. In functional analysis, Milman's theorem is a result which says that if the closed ...

A minimal vertex cover is an vertex cover of a graph that is not a proper subset of any other vertex cover. A minimal vertex cover corresponds to the complement of maximal ...

The fundamental theorem of game theory which states that every finite, zero-sum, two-person game has optimal mixed strategies. It was proved by John von Neumann in 1928. ...

An edge coloring of a graph G is a coloring of the edges of G such that adjacent edges (or the edges bounding different regions) receive different colors. An edge coloring ...

A minimum edge cut of a graph is an edge cut of smallest possible size. The size of a minimum edge cut in a connected graph G is called the graph's edge connectivity ...

In many cases, the Hausdorff dimension correctly describes the correction term for a resonator with fractal perimeter in Lorentz's conjecture. However, in general, the proper ...

A bounded plane convex region symmetric about a lattice point and with area >4 must contain at least three lattice points in the interior. In n dimensions, the theorem can be ...