Search Results for ""

A bicolorable graph G is a graph with chromatic number chi(G)<=2. A graph is bicolorable iff it has no odd graph cycles (König 1950, p. 170; Skiena 1990, p. 213; Harary 1994, ...

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

The bicorn, sometimes also called the "cocked hat curve" (Cundy and Rollett 1989, p. 72), is the name of a collection of quartic curves studied by Sylvester in 1864 and ...

The differential equation obtained by applying the biharmonic operator and setting to zero: del ^4phi=0. (1) In Cartesian coordinates, the biharmonic equation is del ^4phi = ...

The base 2 method of counting in which only the digits 0 and 1 are used. In this base, the number 1011 equals 1·2^0+1·2^1+0·2^2+1·2^3=11. This base is used in computers, ...

Let A and B be two algebras over the same signature Sigma, with carriers A and B, respectively (cf. universal algebra). B is a subalgebra of A if B subset= A and every ...

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 divisor d of a positive integer n is biunitary if the greatest common unitary divisor of d and n/d is 1. For a prime power p^y, the biunitary divisors are the powers 1, p, ...

Let alpha(z),gamma(z):(a,b)->R^3 be curves such that |gamma|=1 and alpha·gamma=0, and suppose that alpha and gamma have holomorphic extensions alpha,gamma:(a,b)×(c,d)->C^3 ...

A method for finding solutions u and v to a linear congruence au+bv=d by constructing a matrix formed by adjoining a vector containing a and b with a unit matrix, M=[a 1 0; b ...