Search Results for ""

Connectivity properties obey the following hierarchy: convex => star convex => pathwise-connected => connected.

An ordered pair (a,b) of nonnegative integers such that there is some set of a points and b edges whose removal disconnects the graph and there is no set of a-1 nodes and b ...

The absence of contradiction (i.e., the ability to prove that a statement and its negative are both true) in an Axiomatic system is known as consistency.

A theorem in set theory stating that, for all sets A and B, the following equivalences hold, A subset B<=>A intersection B=A<=>A union B=B.

A map f:X-->Y is called constant with constant value y if f(x)=y for all x in X, i.e., if all elements of X are sent to same element y of Y.

A polynomial P(x) that, when evaluated over each x in the domain of definition, results in the same value. The simplest example is P(x)=c for x in R and c a constant.

Since the derivative of a constant is zero, any constant may be added to an indefinite integral (i.e., antiderivative) and will still correspond to the same integral. Another ...

A formal argument in logic in which it is stated that (1) P=>Q and R=>S (where => means "implies"), and (2) either P or R is true, from which two statements it follows that ...

The contact angle between a sphere and a tangent plane is the angle alpha between the normal to the sphere at the point of tangency and the basal plane with respect to which ...

A partition p is said to contain another partition q if the Ferrers diagram of p contains the Ferrers diagram of q. For example, {3,3,2} (left figure) contains both {3,3,1} ...