Search Results for ""

Let K be a finite complex, let h:|K|->|K| be a continuous map. If Lambda(h)!=0, then h has a fixed point.

The two-dimensional Hammersley point set of order m is defined by taking all numbers in the range from 0 to 2^m-1 and interpreting them as binary fractions. Calling these ...

A simple point process (or SPP) is an almost surely increasing sequence of strictly positive, possibly infinite random variables which are strictly increasing as long as they ...

The goat problem (or bull-tethering problem) considers a fenced circular field of radius a with a goat (or bull, or other animal) tied to a point on the interior or exterior ...

A point x^* which is mapped to itself under a map G, so that x^*=G(x^*). Such points are sometimes also called invariant points or fixed elements (Woods 1961). Stable fixed ...

A generalization of the Bulirsch-Stoer algorithm for solving ordinary differential equations.

Let A^' be the outermost vertex of the regular pentagon erected inwards on side BC of a reference triangle DeltaABC. Similarly, define B^' and C^'. The triangle ...

Let A^' be the outermost vertex of the regular pentagon erected outward on side BC of a reference triangle DeltaABC. Similarly, define B^' and C^'. The triangle ...

Ball point picking is the selection of points randomly placed inside a ball. n random points can be picked in a unit ball in the Wolfram Language using the function ...

For a general two-player zero-sum game, max_(i<=m)min_(j<=n)a_(ij)<=min_(j<=n)max_(i<=m)a_(ij). If the two are equal, then write ...