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

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 Bland-Altman plot is a data plotting method which simultaneously presents data sets from two different tests in a way that allows for easier determination of whether the ...

Let F be the set of complex analytic functions f defined on an open region containing the set closure of the unit disk D={z:|z|<1} satisfying f(0)=0 and df/dz(0)=1. For each ...

An incidence system (v, k, lambda, r, b) in which a set X of v points is partitioned into a family A of b subsets (blocks) in such a way that any two points determine lambda ...

In discrete percolation theory, bond percolation is a percolation model on a regular point lattice L=L^d in d-dimensional Euclidean space which considers the lattice graph ...