Search Results for ""

The mathematical study of abstract computing machines (especially Turing machines) and the analysis of algorithms used by such machines. A connection between automata theory ...

A point B is said to lie between points A and C (where A, B, and C are distinct collinear points) if AB+BC=AC. A number of Euclid's proofs depend on the idea of betweenness ...

Let g be a finite-dimensional Lie algebra over some field k. A subalgebra h of g is called a Cartan subalgebra if it is nilpotent and equal to its normalizer, which is the ...

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

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