Search Results for ""

The rectilinear crossing number of a graph G is the minimum number of crossings in a straight line embedding of G in a plane. It is variously denoted rcr(G), cr^_(G) ...

A recurrence plot is defined as a plot of the quantity R(t,tau)=H(epsilon-||f(t)-f(tau)||), where H(x) is the Heaviside step function and ||f|| denotes a norm. A recurrence ...

A method for fitting a curve (not necessarily a straight line) through a set of points using some goodness-of-fit criterion. The most common type of regression is linear ...

The regular nonagon is the regular polygon with nine sides and Schläfli symbol {9}. The regular nonagon cannot be constructed using the classical Greek rules of geometric ...

A regular ring in the sense of commutative algebra is a commutative unit ring such that all its localizations at prime ideals are regular local rings. In contrast, a von ...

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

The Reynolds transport theorem, also called simply the Reynolds theorem, is an important result in fluid mechanics that's often considered a three-dimensional analog of the ...

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

Let a closed interval [a,b] be partitioned by points a<x_1<x_2<...<x_(n-1)<b, where the lengths of the resulting intervals between the points are denoted Deltax_1, Deltax_2, ...

A circle packing is called rigid (or "stable") if every circle is fixed by its neighbors, i.e., no circle can be translated without disturbing other circles of the packing ...