Search Results for ""

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

A common mechanism which generates singularities from smooth initial conditions.

The blow-up lemma essentially says that regular pairs in Szemerédi's regularity lemma behave like complete bipartite graphs from the point of view of embedding bounded degree ...

An extremal graph in which the forced triangles are all the same color. Call R the number of red monochromatic forced triangles and B the number of blue monochromatic forced ...

There exists a total computable predicate P such that for any algorithm computing P(x) with running time T(x), there exists another algorithm computing P(x) with computation ...

A board is a subset of the polygons determined by a number of (usually regularly spaced and oriented) lines. These polygons form the spaces on which "pieces" can be placed ...

A second-order ordinary differential equation of the form

The Bôcher Memorial Prize is awarded by the American Mathematical Society every five years for notable research in analysis that has appeared in a recognized North American ...

The finite zeros of the derivative r^'(z) of a nonconstant rational function r(z) that are not multiple zeros of r(z) are the positions of equilibrium in the field of force ...

For a smooth harmonic map u:M->N, where del is the gradient, Ric is the Ricci curvature tensor, and Riem is the Riemann tensor.