Search Results for ""

A simple graph is a line graph of some simple graph iff if does not contain any of the above nine graphs, known in this work as Beineke graphs, as a forbidden induced ...

There are two kinds of Bell polynomials. A Bell polynomial B_n(x), also called an exponential polynomial and denoted phi_n(x) (Bell 1934, Roman 1984, pp. 63-67) is a ...

1 1 2 2 3 5 5 7 10 15 15 20 27 37 52 The Bell triangle, also called Aitken's array or the Peirce triangle (Knuth 2005, p. 28), is the number triangle obtained by beginning ...

A braid with M strands and R components with P positive crossings and N negative crossings satisfies |P-N|<=2U+M-R<=P+N, where U is the unknotting number. While the second ...

The nth Beraha constant (or number) is given by B(n)=2+2cos((2pi)/n). B(5) is phi+1, where phi is the golden ratio, B(7) is the silver constant, and B(10)=phi+2. The ...

If a sequence takes only a small number of different values, then by regarding the values as the elements of a finite field, the Berlekamp-Massey algorithm is an efficient ...

An algorithm that can be used to factor a polynomial f over the integers. The algorithm proceeds by first factoring f modulo a suitable prime p via Berlekamp's method and ...

Let E_n(f) be the error of the best uniform approximation to a real function f(x) on the interval [-1,1] by real polynomials of degree at most n. If alpha(x)=|x|, (1) then ...

The Bessel differential equation is the linear second-order ordinary differential equation given by x^2(d^2y)/(dx^2)+x(dy)/(dx)+(x^2-n^2)y=0. (1) Equivalently, dividing ...

The Bevan point V of a triangle DeltaABC is the circumcenter of the excentral triangle DeltaJ_AJ_BJ_C. It is named in honor of Benjamin Bevan, a relatively unknown Englishman ...