Search Results for ""

A base-b BBP-type formula is a convergent series formula of the type alpha=sum_(k=0)^infty(p(k))/(b^kq(k)) (1) where p(k) and q(k) are integer polynomials in k (Bailey 2000; ...

The Balaban 11-cage is the unique 11-cage graph, derived via a tree excision from the 12-cage graph by Balaban (1973) and proven unique by McKay and Myrvold in 2003. It is ...

There are two definitions of Bernoulli polynomials in use. The nth Bernoulli polynomial is denoted here by B_n(x) (Abramowitz and Stegun 1972), and the archaic form of the ...

Bertrand's postulate, also called the Bertrand-Chebyshev theorem or Chebyshev's theorem, states that if n>3, there is always at least one prime p between n and 2n-2. ...

The conjugate gradient method is not suitable for nonsymmetric systems because the residual vectors cannot be made orthogonal with short recurrences, as proved in Voevodin ...

The bipartite double graph, also called the Kronecker cover, Kronecker double cover, bipartite double cover, canonical double cover, or bipartite double, of a given graph G ...

A bipartite graph, also called a bigraph, is a set of graph vertices decomposed into two disjoint sets such that no two graph vertices within the same set are adjacent. A ...

The bivariate normal distribution is the statistical distribution with probability density function P(x_1,x_2)=1/(2pisigma_1sigma_2sqrt(1-rho^2))exp[-z/(2(1-rho^2))], (1) ...

The m-book graph is defined as the graph Cartesian product B_m=S_(m+1) square P_2, where S_m is a star graph and P_2 is the path graph on two nodes. The generalization of the ...

How far can a stack of n books protrude over the edge of a table without the stack falling over? It turns out that the maximum overhang possible d_n for n books (in terms of ...