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

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

The expected number of trials needed to collect a complete set of n different objects when picked at random with repetition is nH_n (Havil 2003, p. 131). For n=1, 2, ..., the ...

The phrase "convergence in mean" is used in several branches of mathematics to refer to a number of different types of sequential convergence. In functional analysis, ...

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

Let F be the Maclaurin series of a meromorphic function f with a finite or infinite number of poles at points z_k, indexed so that 0<|z_1|<=|z_2|<=|z_3|<=..., then a pole ...

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

There are a number of attractive cube 25-compounds. One can be constructed from the vertices of the second dodecahedron 6-compound (or second tetrahedron 50-compound) and ...

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