Search Results for ""

A k-matching in a graph G is a set of k edges, no two of which have a vertex in common (i.e., an independent edge set of size k). Let Phi_k be the number of k-matchings of ...

The (upper) matching number nu(G) of graph G, sometimes known as the edge independence number, is the size of a maximum independent edge set. Equivalently, it is the degree ...

A curve which may pass through any region of three-dimensional space, as contrasted to a plane curve which must lie in a single plane. Von Staudt (1847) classified space ...

Not continuous. A point at which a function is discontinuous is called a discontinuity, or sometimes a jump.

Let phi:M->M be a C^1 diffeomorphism on a compact Riemannian manifold M. Then phi satisfies Axiom A if the nonwandering set Omega(phi) of phi is hyperbolic and the periodic ...

A group G is said to act on a set X when there is a map phi:G×X->X such that the following conditions hold for all elements x in X. 1. phi(e,x)=x where e is the identity ...

Let F,G:C->D be functors between categories C and D. A natural transformation Phi from F to G consists of a family Phi_C:F(C)->G(C) of morphisms in D which are indexed by the ...

The second Napoleon point N^', also called the inner Napoleon point, is the concurrence of lines drawn between polygon vertices of a given triangle DeltaABC and the opposite ...

(e^(ypsi_0(x))Gamma(x))/(Gamma(x+y))=product_(n=0)^infty(1+y/(n+x))e^(-y/(n+x)), where psi_0(x) is the digamma function and Gamma(x) is the gamma function.

where R[nu]>-1, |argp|<pi/4, and a, b>0, J_nu(z) is a Bessel function of the first kind, and I_nu(z) is a modified Bessel function of the first kind.