Search Results for ""

The system of partial differential equations f_x = 2fgc(x-t) (1) g_t = 2fgc(x-t). (2)

If f_1,...,f_m:R^n->R are exponential polynomials, then {x in R^n:f_1(x)=...f_n(x)=0} has finitely many connected components.

A quantity involving primitive cube roots of unity which can be used to solve the cubic equation.

Let K be a finite complex, let h:|K|->|K| be a continuous map. If Lambda(h)!=0, then h has a fixed point.

Linear programming, sometimes known as linear optimization, is the problem of maximizing or minimizing a linear function over a convex polyhedron specified by linear and ...

The span of an unoriented link diagram (also called the link spread) is the difference between the highest and lowest degrees of its bracket polynomial. The span is a ...

A function whose value decreases to zero more slowly than any nonzero polynomial is said to be a logarithmically decreasing function. The prototypical example is the function ...

Let rho(x) be an mth degree polynomial which is nonnegative in [-1,1]. Then rho(x) can be represented in the form {[A(x)]^2+(1-x^2)[B(x)]^2 for m even; ...

A Lyndon word is an aperiodic notation for representing a necklace.

Let a patch be given by the map x:U->R^n, where U is an open subset of R^2, or more generally by x:A->R^n, where A is any subset of R^2. Then x(U) (or more generally, x(A)) ...