Search Results for ""

A technique used by André (1887) to provide an elegant solution to the ballot problem (Hilton and Pederson 1991) and in study of Wiener processes (Doob 1953; Papoulis 1984, ...

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 second-order ordinary differential equation y^('')+(y^')/x+(1-(nu^2)/(x^2))y=(x-nu)/(pix^2)sin(pinu) whose solutions are Anger functions.

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

Given a point P and a line AB, draw the perpendicular through P and call it PC. Let PD be any other line from P which meets CB in D. In a hyperbolic geometry, as D moves off ...

The region lying between two concentric circles. The area of the annulus formed by two circles of radii a and b (with a>b) is A_(annulus)=pi(a^2-b^2). The annulus is ...

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