Search Results for ""

Combinatorial matrix theory is a rich branch of mathematics that combines combinatorics, graph theory, and linear algebra. It includes the theory of matrices with prescribed ...

Given a complex Hilbert space H with associated space L(H) of continuous linear operators from H to itself, the commutant M^' of an arbitrary subset M subset= L(H) is the ...

If V and W are Banach spaces and T:V->W is a bounded linear operator, the T is said to be a compact operator if it maps the unit ball of V into a relatively compact subset of ...

A compactification of a topological space X is a larger space Y containing X which is also compact. The smallest compactification is the one-point compactification. For ...

A topological space X such that for every closed subset C of X and every point x in X\C, there is a continuous function f:X->[0,1] such that f(x)=0 and f(C)={1}. This is the ...

A number which can be computed to any number of digits desired by a Turing machine. Surprisingly, most irrationals are not computable numbers!

A computation is an operation that begins with some initial conditions and gives an output which follows from a definite set of rules. The most common example are ...

The conditional intensity lambda(t) associated to a temporal point process N is defined to be the expected infinitesimal rate at which events are expected to occur around ...

A path in the complex plane over which contour integration is performed to compute a contour integral. When choosing a contour to evaluate an integral on the real line, a ...

Let f(t) and g(t) be arbitrary functions of time t with Fourier transforms. Take f(t) = F_nu^(-1)[F(nu)](t)=int_(-infty)^inftyF(nu)e^(2piinut)dnu (1) g(t) = ...