Search Results for ""

A tournament sequence is an increasing sequence of positive integers (t_1, t_2, ...) such that t_1=1 and t_(i+1)<=2t_i. Cook and Kleber (2000) show that Meeussen sequences ...

The evolute of the tractrix given by parametric equations x = t-tanht (1) y = secht (2) is the catenary x_e = t (3) y_e = cosht. (4)

The radial curve of the tractrix x = a(t-tanht) (1) y = asecht (2) with radiant point (x_0,y_0) is the kappa curve x_r = x_0+atanht (3) y_r = y_0+asinhttanht. (4)

The tractrix spiral is a spiral with parametric equations x(t) = acostcos(t-tant) (1) y(t) = acostsin(t-tant) (2) for t in [0,pi/2). It is also known as the polar tractrix or ...

A trail is a walk v_0, e_1, v_1, ..., v_k with no repeated edge. The length of a trail is its number of edges. A u,v-trail is a trail with first vertex u and last vertex v, ...

The engineering terminology for one use of Fourier transforms. By breaking up a wave pulse into its frequency spectrum f_nu=F(nu)e^(2piinut), (1) the entire signal can be ...

In nonstandard analysis, the transfer principle is the technical form of the following intuitive idea: "Anything provable about a given superstructure V by passing to 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 ...

One of Cantor's ordinal numbers omega, omega+1, omega+2, ..., omega+omega, omega+omega+1, ... which is "larger" than any whole number.

A graph G is transitive if any three vertices (x,y,z) such that edges (x,y),(y,z) in G imply (x,z) in G. Unlabeled transitive digraphs are called digraph topologies.