Search Results for ""

The power series that defines the exponential map e^x also defines a map between matrices. In particular, exp(A) = e^(A) (1) = sum_(n=0)^(infty)(A^n)/(n!) (2) = ...

Tarski's theorem says that the first-order theory of reals with +, *, =, and > allows quantifier elimination. Algorithmic quantifier elimination implies decidability assuming ...

An entire function f is said to be of finite order if there exist numbers a,r>0 such that |f(z)|<=exp(|z|^a) for all |z|>r. The infimum of all numbers a for which this ...

The infimum of all number a for which |f(z)|<=exp(|z|^a) holds for all |z|>r and f an entire function, is called the order of f, denoted lambda=lambda(f) (Krantz 1999, p. ...

Trigonometric functions of npi/9 radians for n an integer not divisible by 3 (e.g., 40 degrees and 80 degrees) cannot be expressed in terms of sums, products, and finite root ...

A unit circle is a circle of unit radius, i.e., of radius 1. The unit circle plays a significant role in a number of different areas of mathematics. For example, the ...

The Cayley-Purser algorithm is a public-key cryptography algorithm that relies on the fact that matrix multiplication is not commutative. It was devised by Sarah Flannery ...

There are certain optimization problems that become unmanageable using combinatorial methods as the number of objects becomes large. A typical example is the traveling ...

The imaginary number i=sqrt(-1), i.e., the square root of -1. The imaginary unit is denoted and commonly referred to as "i." Although there are two possible square roots of ...

If Omega subset= C is a domain and phi:Omega->C is a one-to-one analytic function, then phi(Omega) is a domain, and area(phi(Omega))=int_Omega|phi^'(z)|^2dxdy (Krantz 1999, ...