Search Results for ""

A square matrix is called bisymmetric if it is both centrosymmetric and either symmetric or antisymmetric (Muir 1960, p. 19).

The smallest unit of binary information, equal to a single 0 or 1. Two bits are called a crumb, four bits are called a nibble, and eight bits are called 1 byte.

The number of single operations (of addition, subtraction, and multiplication) required to complete an algorithm.

If the cross ratio kappa of {AB,CD} satisfy kappa^2-kappa+1=0, (1) then the points are said to form a bivalent range, and {AB,CD}={AC,DB}={AD,BC}=kappa (2) ...

Involving two variables, as opposed to many (multivariate), or one (univariate).

A bivariate polynomial is a polynomial in two variables. Bivariate polynomials have the form f(x,y)=sum_(i,j)a_(i,j)x^iy^j. A homogeneous bivariate polynomial, also called a ...

A bivector, also called a 2-vector, is an antisymmetric tensor of second rank (a.k.a. 2-form). For a bivector X^->, X^->=X_(ab)omega^a ^ omega^b, where ^ is the wedge product ...

The simplest dissection of a square into rectangles of the same areas but different shapes, composed of the seven pieces illustrated above. The square is 210 units on a side, ...

The only Wiedersehen surfaces are the standard round spheres. The conjecture was proven by combining the Berger-Kazdan comparison theorem with A. Weinstein's results for n ...

If a is a point in the open unit disk, then the Blaschke factor is defined by B_a(z)=(z-a)/(1-a^_z), where a^_ is the complex conjugate of a. Blaschke factors allow the ...