Search Results for ""

The entire function B(z) = [(sin(piz))/pi]^2[2/z+sum_(n=0)^(infty)1/((z-n)^2)-sum_(n=1)^(infty)1/((z+n)^2)] (1) = 1-(2sin^2(piz))/(pi^2z^2)[z^2psi_1(z)-z-1], (2) where ...

The Bickart points are the foci F_1 and F_2 of the Steiner circumellipse. They have trilinear coordinates alpha_1:beta_1:gamma_1 and alpha_2:beta_2:gamma_2, where alpha_i = ...

The bicommutant theorem is a theorem within the field of functional analysis regarding certain topological properties of function algebras. The theorem says that, given a ...

A map is called bijective if it is both injective and surjective. A bijective map is also called a bijection. A function f admits an inverse f^(-1) (i.e., "f is invertible") ...

Bisection is the division of a given curve, figure, or interval into two equal parts (halves). A simple bisection procedure for iteratively converging on a solution which is ...

A block graph, also called a clique tree, is a simple graph in which every block is a complete graph. The numbers of connected block graphs on n=1, 2, ... vertices are 1, 1, ...

The set of all zero-systems of a group G is denoted B(G) and is called the block monoid of G since it forms a commutative monoid under the operation of zero-system addition ...

The Bombieri p-norm of a polynomial Q(x)=sum_(i=0)^na_ix^i (1) is defined by [Q]_p=[sum_(i=0)^n(n; i)^(1-p)|a_i|^p]^(1/p), (2) where (n; i) is a binomial coefficient. The ...

An algorithm which can be used to find a good, but not necessarily minimal, edge or vertex coloring for a graph. However, the algorithm does minimally color complete ...

A real-valued stochastic process {B(t):t>=0} is a Brownian motion which starts at x in R if the following properties are satisfied: 1. B(0)=x. 2. For all times ...