Search Results for ""

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

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

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 bracket polynomial is one-variable knot polynomial related to the Jones polynomial. The bracket polynomial, however, is not a topological invariant, since it is changed ...

A braid is an intertwining of some number of strings attached to top and bottom "bars" such that each string never "turns back up." In other words, the path of each string in ...

Given a general quadrilateral with sides of lengths a, b, c, and d, the area is given by K = 1/4sqrt(4p^2q^2-(b^2+d^2-a^2-c^2)^2) (1) = (2) (Coolidge 1939; Ivanov 1960; Beyer ...

Bürmann's theorem deals with the expansion of functions in powers of another function. Let phi(z) be a function of z which is analytic in a closed region S, of which a is an ...

Given two normal subgroups G_1 and G_2 of a group, and two normal subgroups H_1 and H_2 of G_1 and G_2 respectively, H_1(G_1 intersection H_2) is normal in H_1(G_1 ...

There are two definitions of the Carmichael function. One is the reduced totient function (also called the least universal exponent function), defined as the smallest integer ...