Search Results for ""

A curve alpha on a regular surface M is a principal curve iff the velocity alpha^' always points in a principal direction, i.e., S(alpha^')=kappa_ialpha^', where S is the ...

The Racah V-coefficients are written V(j_1j_2j;m_1m_2m) (1) and are sometimes expressed using the related Clebsch-Gordan coefficients C_(m_1m_2)^j=(j_1j_2m_1m_2|j_1j_2jm), ...

The so-called reaching algorithm can solve the shortest path problem (i.e., the problem of finding the graph geodesic between two given nodes) on an m-edge graph in O(m) ...

The shortest path problem seeks to find the shortest path (a.k.a. graph geodesic) connecting two specific vertices (u,v) of a directed or undirected graph. The length of the ...

Starting with a triangle, draw a circle touching two sides. Then draw a circle tangent to this circle and two other sides. Continue in the same direction. The result is a ...

Given an ordinary differential equation y^'=f(x,y), the slope field for that differential equation is the vector field that takes a point (x,y) to a unit vector with slope ...

The difference between the sum of the angles A, B, and C of a spherical triangle and pi radians (180 degrees), E=A+B+C-pi. The notation Delta is sometimes used for spherical ...

A figure formed by taking a series of steps of length 1, 2, ..., n, with an angle theta turn after each step. The symbol for a spirolateral is ^(a_1,...,a_k)n_theta, where ...

A strongly connected digraph is a directed graph in which it is possible to reach any node starting from any other node by traversing edges in the direction(s) in which they ...

Let L denote the n×n triangular lattice with wraparound. Call an orientation of L an assignment of a direction to each edge of L, and denote the number of orientations of L ...