Search Results for ""

A triangle ABC formed by three circular arcs. By extending the arcs into complete circles, the points of intersection A^', B^', and C^' are obtained. This gives the three ...

Let {a_n} be a nonnegative sequence and f(x) a nonnegative integrable function. Define A_n=sum_(k=1)^na_k (1) and F(x)=int_0^xf(t)dt (2) and take p>1. For sums, ...

Home plate in the game of baseball is an irregular pentagon with two parallel sides, each perpendicular to a base. It seems reasonable to dub such a figure (i.e., a rectangle ...

A quotient of two polynomials P(z) and Q(z), R(z)=(P(z))/(Q(z)), is called a rational function, or sometimes a rational polynomial function. More generally, if P and Q are ...

The hypothesis that an integer n is prime iff it satisfies the condition that 2^n-2 is divisible by n. Dickson (2005, p. 91) stated that Leibniz believe to have proved that ...

The blossom algorithm (Edmonds 1965) finds a maximum independent edge set in a (possibly weighted) graph. While a maximum independent edge set can be found fairly easily for ...

The Brinkmann graph (misspelled by Cancela et al. (2004) as "Brinkman") is a weakly regular quartic graph on 21 vertices and 42 edges. It was first mentioned in Brinkmann ...

A cograph (or "complement-reducible graph") is simple graph defined by the criteria 1. K_1 is a cograph, 2. If X is a cograph, then so is its graph complement, and 3. If X ...

Continuum percolation can be thought of as a continuous, uncountable version of percolation theory-a theory which, in its most studied form, takes place on a discrete, ...

The phrase dependent percolation is used in two-dimensional discrete percolation to describe any general model in which the states of the various graph edges (in the case of ...