Search Results for ""

A generalized mobile automaton is a generalization of the mobile automaton in which the automaton may have more than one active cell. Generalized mobile automata allow for ...

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

There are several definitions of the strength of a graph. Harary and Palmer (1959) and Harary and Palmer (1973, p. 66) define the strength of a tree as the maximum number of ...

In the early 1950s, Ernst Straus asked 1. Is every region illuminable from every point in the region? 2. Is every region illuminable from at least one point in the region? ...

The Motzkin numbers enumerate various combinatorial objects. Donaghey and Shapiro (1977) give 14 different manifestations of these numbers. In particular, they give the ...

The normal vector, often simply called the "normal," to a surface is a vector which is perpendicular to the surface at a given point. When normals are considered on closed ...

The trilinear pole of the orthotransversal of a point P is called its orthocorrespondent. The orthocorrespondent of a point P=p:q:r is given by where S_A, S_B, and S_C is ...

Approximants derived by expanding a function as a ratio of two power series and determining both the numerator and denominator coefficients. Padé approximations are usually ...

A parallelogram is a quadrilateral with opposite sides parallel (and therefore opposite angles equal). A quadrilateral with equal sides is called a rhombus, and a ...

The simplex method is a method for solving problems in linear programming. This method, invented by George Dantzig in 1947, tests adjacent vertices of the feasible set (which ...