Search Results for ""

Dickson (1913, 2005) defined an amicable triple to be a triple of three numbers (l,m,n) such that s(l) = m+n (1) s(m) = l+n (2) s(n) = l+m, (3) where s(n) is the restricted ...

R. C. Read defined the anarboricity of a graph G as the maximum number of edge-disjoint nonacyclic (i.e., cyclic) subgraphs of G whose union is G (Harary and Palmer 1973, p. ...

The Andrews-Schur identity states sum_(k=0)^nq^(k^2+ak)[2n-k+a; k]_q =sum_(k=-infty)^inftyq^(10k^2+(4a-1)k)[2n+2a+2; n-5k]_q([10k+2a+2]_q)/([2n+2a+2]_q) (1) where [n; m]_q is ...

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

An entire function which is a generalization of the Bessel function of the first kind defined by J_nu(z)=1/piint_0^picos(nutheta-zsintheta)dtheta. Anger's original function ...

An Anosov diffeomorphism is a C^1 diffeomorphism phi of a manifold M to itself such that the tangent bundle of M is hyperbolic with respect to phi. Very few classes of Anosov ...

A flow defined analogously to the Anosov diffeomorphism, except that instead of splitting the tangent bundle into two invariant sub-bundles, they are split into three (one ...

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

An antelope graph (Jelliss 2019) is a graph formed by all possible moves of a hypothetical chess piece called an "antelope" which moves analogously to a knight except that it ...

Because even high-resolution computer monitors have a relatively small number of pixels, when graphics or text display distinguish between individual pixels. The result is ...