Search Results for ""

The ant colony algorithm is an algorithm for finding optimal paths that is based on the behavior of ants searching for food. At first, the ants wander randomly. When an ant ...

E. Pegg Jr. (pers. comm., Nov. 8, 2004) found an approximation to Apéry's constant zeta(3) given by zeta(3) approx 10+zeta(16)-sqrt(96), (1) which is good to 6 digits. M. ...

The ascending chain condition, commonly abbreviated "A.C.C.," for a partially ordered set X requires that all increasing sequences in X become eventually constant. A module M ...

Given a module M over a commutative unit ring R and a filtration F:... subset= I_2 subset= I_1 subset= I_0=R (1) of ideals of R, the associated graded module of M with ...

Given a commutative unit ring R and a filtration F:... subset= I_2 subset= I_1 subset= I_0=R (1) of ideals of R, the associated graded ring of R with respect to F is the ...

Given a principal bundle pi:A->M, with fiber a Lie group G and base manifold M, and a group representation of G, say phi:G×V->V, then the associated vector bundle is ...

A black bishop graph is a graph formed from possible moves of a bishop chess piece, which may make diagonal moves of any length on a chessboard (or any other board), when ...

A block diagonal matrix, also called a diagonal block matrix, is a square diagonal matrix in which the diagonal elements are square matrices of any size (possibly even 1×1), ...

Every bounded infinite set in R^n has an accumulation point. For n=1, an infinite subset of a closed bounded set S has an accumulation point in S. For instance, given a ...

The great success mathematicians had studying hypergeometric functions _pF_q(a_1,...,a_p;b_1,...,b_q;z) for the convergent cases (p<=q+1) prompted attempts to provide ...