Search Results for ""

For a curve with radius vector r(t), the unit tangent vector T^^(t) is defined by T^^(t) = (r^.)/(|r^.|) (1) = (r^.)/(s^.) (2) = (dr)/(ds), (3) where t is a parameterization ...

Consider a horse rider who wishes to feed his horse at a field, gather water from a river, and then return to his tent, all in the smallest overall distance possible. The ...

A topological space M satisfying some separability (i.e., it is a T2-space) and countability (i.e., it is a paracompact space) conditions such that every point p in M has a ...

Let phi(z)=cz+c_0+c_1z^(-1)+c_2z^(-2)+... be an analytic function, regular and univalent for |z|>1, that maps |z|>1 conformally onto the region T preserving the point at ...

The catacaustic of the Tschirnhausen cubic with parametric representation x = 3(t^2-3) (1) y = t(t^2-3) (2) with radiant point at (-8,0) is the semicubical parabola with ...

A quantity which takes on the value zero is said to vanish. For example, the function f(z)=z^2 vanishes at the point z=0. For emphasis, the term "vanish identically" is ...

The point about which an angle is measured is called the angle's vertex, and the angle theta associated with a given vertex is called the vertex angle. In a polygon, the ...

The vertex connectivity kappa(G) of a graph G, also called "point connectivity" or simply "connectivity," is the minimum size of a vertex cut, i.e., a vertex subset S subset= ...

A weakly connected digraph is a directed graph in which it is possible to reach any node starting from any other node by traversing edges in some direction (i.e., not ...

A lattice path from one point to another is p-good if it lies completely below the line y=(p-1)x. (1) Hilton and Pederson (1991) show that the number of p-good paths from (1, ...