Search Results for ""

A graph H is a minor of a graph G if a copy of H can be obtained from G via repeated edge deletion and/or edge contraction. The Kuratowski reduction theorem states that any ...

Let f(z) be an entire function such that f(n) is an integer for each positive integer n. Then Pólya (1915) showed that if lim sup_(r->infty)(lnM_r)/r<ln2=0.693... (1) (OEIS ...

Set covering deployment (sometimes written "set-covering deployment" and abbreviated SCDP for "set covering deployment problem") seeks an optimal stationing of troops in a ...

A test used to determine the statistical significance of an observation. Two main types of error can occur: 1. A type I error occurs when a false negative result is obtained ...

A unigraphic graph (or simply a "unigraph") is a graph that is isomorphic to every graph having that degree sequence. All graphs on four are fewer vertices are unigraphic. ...

The one-dimensional wave equation is given by (partial^2psi)/(partialx^2)=1/(v^2)(partial^2psi)/(partialt^2). (1) In order to specify a wave, the equation is subject to ...

A triangle line lalpha+mbeta+ngamma=0 defined relative to a reference triangle is called a central line iff l:m:n is a triangle center (Kimberling 1998, p. 127). If l:m:n is ...

Calculus I

Given a triangle center X=l:m:n, the line mnalpha+nlbeta+lmgamma=0, where alpha:beta:gamma are trilinear coordinates, is called the trilinear polar (Kimberling 1998, p. 38). ...

There are many mathematical and recreational problems related to folding. Origami, the Japanese art of paper folding, is one well-known example. It is possible to make a ...