Search Results for ""

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 ...

Let mu be a positive measure on a sigma-algebra M, and let lambda be an arbitrary (real or complex) measure on M. If there is a set A in M such that lambda(E)=lambda(A ...

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 ...

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

Two or more lines are said to be concurrent if they intersect in a single point. Two lines concur if their trilinear coordinates satisfy |l_1 m_1 n_1; l_2 m_2 n_2; l_3 m_3 ...

The formal term in propositional calculus for the connective implies.

The conditional probability of an event A assuming that B has occurred, denoted P(A|B), equals P(A|B)=(P(A intersection B))/(P(B)), (1) which can be proven directly using a ...