Search Results for ""

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

Binet's formula is an equation which gives the nth Fibonacci number as a difference of positive and negative nth powers of the golden ratio phi. It can be written as F_n = ...

The binomial transform takes the sequence a_0, a_1, a_2, ... to the sequence b_0, b_1, b_2, ... via the transformation b_n=sum_(k=0)^n(-1)^(n-k)(n; k)a_k. The inverse ...

If a continuous function defined on an interval is sometimes positive and sometimes negative, it must be 0 at some point. Bolzano (1817) proved the theorem (which effectively ...

The bootstrap method is a computer-based method for assigning measures of accuracy to sample estimates (Efron and Tibshirani 1994). This technique allows estimation of the ...

An n-bridge knot is a knot with bridge number n. The set of 2-bridge knots is identical to the set of rational knots. If L is a 2-bridge knot, then the BLM/Ho polynomial Q ...

The (weak) Bruhat graph B_n of order n is the simple graph having have all permutations of {1,2,...,n} as vertices, and with an edge between pairs of permutations that differ ...

A bundle map is a map between bundles along with a compatible map between the base manifolds. Suppose p:X->M and q:Y->N are two bundles, then F:X->Y is a bundle map if there ...

A cadlag function is a function, defined on R or a subset of R, that is right continuous and has a left limit. The acronym cadlag comes from the French "continue à droite, ...

The word canonical is used to indicate a particular choice from of a number of possible conventions. This convention allows a mathematical object or class of objects to be ...