Search Results for ""

In most computer programs and computing environments, the precision of any calculation (even including addition) is limited by the word size of the computer, that is, by ...

There are at least two statements which go by the name of Artin's conjecture. If r is any complex finite-dimensional representation of the absolute Galois group of a number ...

In functional analysis, the Banach-Alaoglu theorem (also sometimes called Alaoglu's theorem) is a result which states that the norm unit ball of the continuous dual X^* of a ...

First stated in 1924, the Banach-Tarski paradox states that it is possible to decompose a ball into six pieces which can be reassembled by rigid motions to form two balls of ...

Bézout's theorem for curves states that, in general, two algebraic curves of degrees m and n intersect in m·n points and cannot meet in more than m·n points unless they have ...

The sequence a(n) given by the exponents of the highest power of 2 dividing n, i.e., the number of trailing 0s in the binary representation of n. For n=1, 2, ..., the first ...

A binomial number is a number of the form a^n+/-b^n, where a,b, and n are integers. Binomial numbers can be factored algebraically as ...

A block is a maximal connected subgraph of a given graph G that has no articulation vertex (West 2000, p. 155). If a block has more than two vertices, then it is biconnected. ...

A board is a subset of the polygons determined by a number of (usually regularly spaced and oriented) lines. These polygons form the spaces on which "pieces" can be placed ...

Let f:M|->N be a map between two compact, connected, oriented n-dimensional manifolds without boundary. Then f induces a homomorphism f_* from the homology groups H_n(M) to ...