Search Results for ""

The Lotka-Volterra equations describe an ecological predator-prey (or parasite-host) model which assumes that, for a set of fixed positive constants A (the growth rate of ...

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

Draw three circles in the plane, none of which lies completely inside another, and the common external tangent lines for each pair. Then points of intersection of the three ...

A direct search method of optimization that works moderately well for stochastic problems. It is based on evaluating a function at the vertices of a simplex, then iteratively ...

Newton's method for finding roots of a complex polynomial f entails iterating the function z-[f(z)/f^'(z)], which can be viewed as applying the Euler backward method with ...

Newton's forward difference formula is a finite difference identity giving an interpolated value between tabulated points {f_p} in terms of the first value f_0 and the powers ...

The path covering number (or path-covering number; Slater 1972) of a graph G, variously denoted as summarized below, is the minimum number of vertex-disjoint paths that cover ...

Perspective is the art and mathematics of realistically depicting three-dimensional objects in a two-dimensional plane, sometimes called centric or natural perspective to ...

The illusion that the two ends of a straight line segment passing behind an obscuring rectangle are offset when, in fact, they are aligned. The Poggendorff illusion was ...