Search Results for ""

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

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

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

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

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

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

The Bonferroni correction is a multiple-comparison correction used when several dependent or independent statistical tests are being performed simultaneously (since while a ...