Search Results for ""

Although a numerically computed chaotic trajectory diverges exponentially from the true trajectory with the same initial coordinates, there exists an errorless trajectory ...

Informally, a symplectic map is a map which preserves the sum of areas projected onto the set of (p_i,q_i) planes. It is the generalization of an area-preserving map. ...

The Trott curve is a simple example of a quartic curve having 28 real bitangents-the maximum possible for a quartic-given by the equation ...

For r and x real, with 0<=arg(sqrt(k^2-tau^2))<pi and 0<=argk<pi, 1/2iint_(-infty)^inftyH_0^((1))(rsqrt(k^2-tau^2))e^(itaux)dtau=(e^(iksqrt(r^2+x^2)))/(sqrt(r^2+x^2)), where ...

A binary unit of information equal to 8 bits. Unfortunately, the storage of binary numbers in computers is not entirely standardized. Because computers store information in ...

The number 1. There are n nth roots of unity, known as the de Moivre numbers.

A copositive matrix is a real n×n square matrix A=(a_(ij)) that makes the corresponding quadratic form f(x)=x^(T)Ax nonnegative for all nonnegative n-vectors x. Copositive ...

A doubly nonnegative matrix is a real positive semidefinite n×n square matrix with nonnegative entries. Any doubly nonnegative matrix A of order n can be expressed as a Gram ...

The maximum possible weight of a fractional clique of a graph G is called the fractional clique number of G, denoted omega^*(G) (Godsil and Royle 2001, pp. 136-137) or ...

The signed Stirling numbers of the first kind are variously denoted s(n,m) (Riordan 1980, Roman 1984), S_n^((m)) (Fort 1948, Abramowitz and Stegun 1972), S_n^m (Jordan 1950). ...