Search Results for ""

A complex map is a map f:C->C. The following table lists several common types of complex maps. map formula domain complex magnification f(z)=az a in R, a>0 complex rotation ...

A complex vector bundle is a vector bundle pi:E->M whose fiber bundle pi^(-1)(x) is a complex vector space. It is not necessarily a complex manifold, even if its base ...

An n-component of a graph G is a maximal n-connected subgraph.

A set in R^d is concave if it does not contain all the line segments connecting any pair of its points. If the set does contain all the line segments, it is called convex.

A function f(x) is said to be concave on an interval [a,b] if, for any points x_1 and x_2 in [a,b], the function -f(x) is convex on that interval (Gradshteyn and Ryzhik 2000).

A concave polygon is a polygon that is not convex. A simple polygon is concave iff at least one of its internal angles is greater than 180 degrees. An example of a non-simple ...

A concho-spiral, also known as a conchospiral, is a space curve with parametric equations r = mu^ua (1) theta = u (2) z = mu^uc, (3) where mu, a, and c are fixed parameters. ...

A conclusion is a statement arrived at by applying a set of logical rules known as syllogisms to a set of premises. The process of drawing conclusions from premises and ...

A concordance between knots K_0 and K_1 in S^3 is a locally flat cylinder C=S^1×[0,1] embedded in S^3×[0,1] in such a way that the ends S^1×{1} are embedded in S^3×{i} as ...

Two or more lines which intersect in a point are said to concur.