Search Results for ""

Roman (1984, p. 26) defines "the" binomial identity as the equation p_n(x+y)=sum_(k=0)^n(n; k)p_k(y)p_(n-k)(x). (1) Iff the sequence p_n(x) satisfies this identity for all y ...

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

There are several related series that are known as the binomial series. The most general is (x+a)^nu=sum_(k=0)^infty(nu; k)x^ka^(nu-k), (1) where (nu; k) is a binomial ...

A biplanar graph is defined as a graph that is the graph union of two planar edge-induced subgraphs. In other words, biplanar graphs are graphs with graph thickness 1 or 2 ...

A bishop graph is a graph formed from possible moves of a bishop chess piece, which may make diagonal moves of any length on a chessboard (or any other board). To form the ...

Find the maximum number of bishops B(n) that can be placed on an n×n chessboard such that no two attack each other. The answer is 2n-2 (Dudeney 1970, Madachy 1979), giving ...

The skeleton of the bislit cube is the 8-vertex simple graph, illustrated above in several embeddings, which consists of a cube in which two opposite faces have polyhedron ...

A bitangent is a line that is tangent to a curve at two distinct points. Aa general plane quartic curve has 28 bitangents in the complex projective plane. However, as shown ...

The Blancmange function, also called the Takagi fractal curve (Peitgen and Saupe 1988), is a pathological continuous function which is nowhere differentiable. Its name ...

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