Search Results for ""

A curvilinear polygon built up of circular arcs. The Reuleaux polygon is a generalization of the Reuleaux triangle and, for an odd number of sides, is a curve of constant ...

Vizing's theorem states that a graph can be edge-colored in either Delta or Delta+1 colors, where Delta is the maximum vertex degree of the graph. A graph with edge chromatic ...

A fractal process for which H<1/2, so r<0.

A fractal process for which H>1/2, so r>0.

Let Pi be a permutation of n elements, and let alpha_i be the number of permutation cycles of length i in this permutation. Picking Pi at random, it turns out that ...

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

There are two versions of the moat-crossing problem, one geometric and one algebraic. The geometric moat problems asks for the widest moat Rapunzel can cross to escape if she ...

If Omega_1 and Omega_2 are bounded domains, partialOmega_1, partialOmega_2 are Jordan curves, and phi:Omega_1->Omega_2 is a conformal mapping, then phi (respectively, ...

The linear fractional transformation z|->(i-z)/(i+z) that maps the upper half-plane {z:I[z]>0} conformally onto the unit disk {z:|z|<1}.

If (f,U) and (g,V) are functions elements, then (g,V) is a direct analytic continuation of (f,U) if U intersection V!=emptyset and f and g are equal on U intersection V.