Search Results for ""

An action with G=R. Flows are generated by vector fields and vice versa.

A flow line for a map on a vector field F is a path sigma(t) such that sigma^'(t)=F(sigma(t)).

A type of flow technically defined in terms of the tangent bundle of a manifold.

The network flow problem considers a graph G with a set of sources S and sinks T and for which each edge has an assigned capacity (weight), and then asks to find the maximum ...

A flow defined analogously to the axiom A diffeomorphism, except that instead of splitting the tangent bundle into two invariant sub-bundles, they are split into three (one ...

A flow defined analogously to the Anosov diffeomorphism, except that instead of splitting the tangent bundle into two invariant sub-bundles, they are split into three (one ...

Let C^*(u) denote the number of nowhere-zero u-flows on a connected graph G with vertex count n, edge count m, and connected component count c. This quantity is called the ...

The Ricci flow equation is the evolution equation d/(dt)g_(ij)(t)=-2R_(ij) for a Riemannian metric g_(ij), where R_(ij) is the Ricci curvature tensor. Hamilton (1982) showed ...

The maximum flow between vertices v_i and v_j in a graph G is exactly the weight of the smallest set of edges to disconnect G with v_i and v_j in different components (Ford ...

The motion along a phase curve as a function of time (Tabor 1989, p. 14).