Search Results for ""

A game in which no draw is possible. Steinhaus (1999, p. 16) stated that all categorical games are unfair, but this is incorrect. For example, the game "Odds or Evens" pits ...

Let P be a finite partially ordered set. A chain in P is a set of pairwise comparable elements (i.e., a totally ordered subset). The partial order length of P is the maximum ...

If g(x) is differentiable at the point x and f(x) is differentiable at the point g(x), then f degreesg is differentiable at x. Furthermore, let y=f(g(x)) and u=g(x), then ...

All closed surfaces, despite their seemingly diverse forms, are topologically equivalent to spheres with some number of handles or cross-caps. The traditional proof follows ...

A notation for polyhedra which begins by specifying a "seed" polyhedron using a capital letter. The Platonic solids are denoted T (tetrahedron), O (octahedron), C (cube), I ...

A covering map (also called a covering or projection) is a surjective open map f:X->Y that is locally a homeomorphism, meaning that each point in X has a neighborhood that is ...

There are a number of attractive cube 20-compounds that can be constructed by taking the duals of the octahedra in the two octahedron 20-compounds. The second of these was ...

Does there exist an algorithm for deciding whether or not a specific mathematical assertion does or does not have a proof? The decision problem is also known as the ...

Given a polygon with an even number of sides, the derived polygon is obtained by joining the points which are a fractional distance r along each side. If r=1/2, then the ...

Consider the length of the diagonal of a unit square as approximated by piecewise linear steps that may only be taken in the right and up directions. Obviously, the length so ...