Search Results for ""

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

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

The binomial coefficient (n; k) is the number of ways of picking k unordered outcomes from n possibilities, also known as a combination or combinatorial number. The symbols ...

Roman (1984, p. 26) defines "the" binomial identity as the equation p_n(x+y)=sum_(k=0)^n(n; k)p_k(y)p_(n-k)(x). (1) Iff the sequence p_n(x) satisfies this identity for all y ...

Branch and bound algorithms are a variety of adaptive partition strategies have been proposed to solve global optimization models. These are based upon partition, sampling, ...

A polyhedron is said to be canonical if all its polyhedron edges touch a sphere and the center of gravity of their contact points is the center of that sphere. In other ...

Let J be a finite group and the image R(J) be a representation which is a homomorphism of J into a permutation group S(X), where S(X) is the group of all permutations of a ...

A problem sometimes known as Moser's circle problem asks to determine the number of pieces into which a circle is divided if n points on its circumference are joined by ...

The complementary Bell numbers, also called the Uppuluri-Carpenter numbers, B^~_n=sum_(k=0)^n(-1)^kS(n,k) (1) where S(n,k) is a Stirling number of the second kind, are ...