Search Results for ""

In algebraic topology, the Reidemeister torsion is a notion originally introduced as a topological invariant of 3-manifolds which has now been widely adapted to a variety of ...

The Remez algorithm (Remez 1934), also called the Remez exchange algorithm, is an application of the Chebyshev alternation theorem that constructs the polynomial of best ...

For a real positive t, the Riemann-Siegel Z function is defined by Z(t)=e^(itheta(t))zeta(1/2+it). (1) This function is sometimes also called the Hardy function or Hardy ...

The Riemann tensor (Schutz 1985) R^alpha_(betagammadelta), also known the Riemann-Christoffel curvature tensor (Weinberg 1972, p. 133; Arfken 1985, p. 123) or Riemann ...

In analysis, the phrase "Riesz-Fischer theorem" is used to describe a number of results concerning the convergence of Cauchy sequences in L-p spaces. The theorem is named for ...

A list of five properties of a topological space X expressing how rich the "population" of open sets is. More precisely, each of them tells us how tightly a closed subset can ...

Set covering deployment (sometimes written "set-covering deployment" and abbreviated SCDP for "set covering deployment problem") seeks an optimal stationing of troops in a ...

A sequence s_n(x) is called a Sheffer sequence iff its generating function has the form sum_(k=0)^infty(s_k(x))/(k!)t^k=A(t)e^(xB(t)), (1) where A(t) = A_0+A_1t+A_2t^2+... ...

The simplex method is a method for solving problems in linear programming. This method, invented by George Dantzig in 1947, tests adjacent vertices of the feasible set (which ...

A method for finding recurrence relations for hypergeometric polynomials directly from the series expansions of the polynomials. The method is effective and easily ...