Search Results for ""

Let a graph G=(V,E) be defined on vertex set V and edge set E. Then a construction sequence (or c-sequence) for G is a linear order on V union E in which each edge appears ...

Critical damping is a special case of damped simple harmonic motion x^..+betax^.+omega_0^2x=0, (1) in which D=beta^2-4omega_0^2=0, (2) where beta is the damping constant. ...

A cross-handle is a topological structure which can be thought of as the object produced by puncturing a surface twice, attaching a zip around each puncture travelling in the ...

A limiting case in which a class of object changes its nature so as to belong to another, usually simpler, class. For example, the point is a degenerate case of the circle as ...

sum_(1<=k<=n)(n; k)((-1)^(k-1))/(k^m)=sum_(1<=i_1<=i_2<=...<=i_m<=n)1/(i_1i_2...i_m), (1) where (n; k) is a binomial coefficient (Dilcher 1995, Flajolet and Sedgewick 1995, ...

Elliptic rational functions R_n(xi,x) are a special class of rational functions that have nice properties for approximating other functions over the interval x in [-1,1]. In ...

The second-order ordinary differential equation y^('')+2xy^'-2ny=0, (1) whose solutions may be written either y=Aerfc_n(x)+Berfc_n(-x), (2) where erfc_n(x) is the repeated ...

A square array made by combining n objects of two types such that the first and second elements form Latin squares. Euler squares are also known as Graeco-Latin squares, ...

For a general second-order linear recurrence equation f_(n+1)=xf_n+yf_(n-1), (1) define a multiplication rule on ordered pairs by (A,B)(C,D)=(AD+BC+xAC,BD+yAC). (2) The ...

A reduction system is called finitely terminating (or Noetherian) if there are no infinite rewriting sequences. This property guarantees that any rewriting algorithm will ...