Search Results for ""

An algorithm originally described by Barnsley in 1988. Pick a point at random inside a regular n-gon. Then draw the next point a fraction r of the distance between it and a ...

A compact manifold is a manifold that is compact as a topological space. Examples are the circle (the only one-dimensional compact manifold) and the n-dimensional sphere and ...

The complementary subspace problem asks, in general, which closed subspaces of a Banach space are complemented (Johnson and Lindenstrauss 2001). Phillips (1940) proved that ...

Form a sequence from an alphabet of letters [1,n] such that there are no consecutive letters and no alternating subsequences of length greater than d. Then the sequence is a ...

Find the figure bounded by a line which has the maximum area for a given perimeter. The solution is a semicircle. The problem is based on a passage from Virgil's Aeneid: "The ...

A letter of the alphabet drawn with doubled vertical strokes is called doublestruck, or sometimes blackboard bold (because doublestruck characters provide a means of ...

A second-order partial differential equation, i.e., one of the form Au_(xx)+2Bu_(xy)+Cu_(yy)+Du_x+Eu_y+F=0, (1) is called elliptic if the matrix Z=[A B; B C] (2) is positive ...

An embedding is a representation of a topological object, manifold, graph, field, etc. in a certain space in such a way that its connectivity or algebraic properties are ...

Let a closed surface have genus g. Then the polyhedral formula generalizes to the Poincaré formula chi(g)=V-E+F, (1) where chi(g)=2-2g (2) is the Euler characteristic, ...

The term "Euler graph" is sometimes used to denote a graph for which all vertices are of even degree (e.g., Seshu and Reed 1961). Note that this definition is different from ...