Search Results for ""

Approximants derived by expanding a function as a ratio of two power series and determining both the numerator and denominator coefficients. Padé approximations are usually ...

If all the diagonals--including those obtained by "wrapping around" the edges--of a magic square sum to the same magic constant, the square is said to be a panmagic square ...

A quadratic form Q(z) is said to be positive definite if Q(z)>0 for z!=0. A real quadratic form in n variables is positive definite iff its canonical form is ...

Propositional calculus is the formal basis of logic dealing with the notion and usage of words such as "NOT," "OR," "AND," and "implies." Many systems of propositional ...

A public-key cryptography algorithm which uses prime factorization as the trapdoor one-way function. Define n=pq (1) for p and q primes. Also define a private key d and a ...

The concept of "random close packing" was shown by Torquato et al. (2000) to be mathematically ill-defined idea that is better replaced by the notion of "maximally random ...

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