Search Results for ""

The algebraic unknotting number of a knot K in S^3 is defined as the algebraic unknotting number of the S-equivalence class of a Seifert matrix of K. The algebraic unknotting ...

The alternating group graph AG_n is the undirected Cayley graph of the set of 2(n-2) generators of the alternating group A_n given by g_3^-, g_3^+, g_4^-, g_4^+, ..., g_n^-, ...

A link which has a link diagram with alternating underpasses and overpasses. The proportion of links which are alternating tends exponentially to zero with increasing ...

A number n is called amenable if it can be built up from integers a_1, a_2, ..., a_k by either addition or multiplication such that sum_(i=1)^na_i=product_(i=1)^na_i=n (1) ...

In a game proposed by J. H. Conway, a devil chases an angel on an infinite chessboard. At each move, the devil can eliminate one of the squares, and the angel can make a leap ...

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

Given a point P, the point P^' which is the antipodal point of P is said to be the antipode of P. The term antipode is also used in plane geometry. Given a central conic (or ...

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

A number of the form 2^n that contains the digits 666 (i.e., the beast number) is called an apocalyptic number. 2^(157) is an apocalyptic number. The first few such powers ...

Successive application of Archimedes' recurrence formula gives the Archimedes algorithm, which can be used to provide successive approximations to pi (pi). The algorithm is ...