Search Results for ""

A strict order > on the set of terms of a term rewriting system is called a reduction order if 1. The set of terms is well ordered with respect to >, that is, all its ...

The regular hendecagon is the regular polygon with 11 sides, as illustrated above, and has Schläfli symbol {11}. The regular hendecagon cannot be constructed using the ...

The regularized gamma functions are defined by P(a,z) = (gamma(a,z))/(Gamma(a)) (1) Q(a,z) = (Gamma(a,z))/(Gamma(a)), (2) where gamma(a,z) and Gamma(a,z) are incomplete gamma ...

In the 1930s, Reidemeister first rigorously proved that knots exist which are distinct from the unknot. He did this by showing that all knot deformations can be reduced to a ...

A repeated integral is an integral taken multiple times over a single variable (as distinguished from a multiple integral, which consists of a number of integrals taken with ...

A balanced incomplete block design (B,V) is called resolvable if there exists a partition R of its set of blocks B into parallel classes, each of which in turn partitions the ...

For a set partition of n elements, the n-character string a_1a_2...a_n in which each character gives the set block (B_0, B_1, ...) in which the corresponding element belongs ...

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

A rhombus is a quadrilateral with both pairs of opposite sides parallel and all sides the same length, i.e., an equilateral parallelogram. The word rhomb is sometimes used ...

Riddell's formula for unlabeled graphs is the Euler transform relating the number of unlabeled connected graphs on n nodes satisfying some property with the corresponding ...