Search Results for ""

A weakly connected component of a simple directed graph (i.e., a digraph without loops) is a maximal subdigraph such that for every pair of distinct vertices u, v in the ...

The principal branch of an analytic multivalued function, also called a principal sheet, is a single-valued "slice" (i.e., branch) of the function chosen that is for ...

If a function f has a pole at z_0, then the negative power part sum_(j=-k)^(-1)a_j(z-z_0)^j (1) of the Laurent series of f about z_0 sum_(j=-k)^inftya_j(z-z_0)^j (2) is ...

An ideal I of a ring R is called principal if there is an element a of R such that I=aR={ar:r in R}. In other words, the ideal is generated by the element a. For example, the ...

A strongly connected component of a simple directed graph (i.e., a digraph without loops) is a maximal subdigraph such that for every pair of distinct vertices u, v in the ...

Given a compact manifold M and a transversely orientable codimension-one foliation F on M which is tangent to partialM, the pair (M,F) is called a generalized Reeb component ...

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 directions in which the principal curvatures occur.

A tangent vector v_(p)=v_1x_u+v_2x_v is a principal vector iff det[v_2^2 -v_1v_2 v_1^2; E F G; e f g]=0, where e, f, and g are coefficients of the first fundamental form and ...

A polygon vertex x_i of a simple polygon P is a principal polygon vertex if the diagonal [x_(i-1),x_(i+1)] intersects the boundary of P only at x_(i-1) and x_(i+1).