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

Given a square complex or real matrix A, a matrix norm ||A|| is a nonnegative number associated with A having the properties 1. ||A||>0 when A!=0 and ||A||=0 iff A=0, 2. ...

An independent vertex set of a graph G is a subset of the vertices such that no two vertices in the subset represent an edge of G. Given a vertex cover of a graph, all ...

The minimum spanning tree of a weighted graph is a set of edges of minimum total weight which form a spanning tree of the graph. When a graph is unweighted, any spanning tree ...

A minimum vertex cover is a vertex cover having the smallest possible number of vertices for a given graph. The size of a minimum vertex cover of a graph G is known as the ...

The network flow problem considers a graph G with a set of sources S and sinks T and for which each edge has an assigned capacity (weight), and then asks to find the maximum ...

Let K be a field of arbitrary characteristic. Let v:K->R union {infty} be defined by the following properties: 1. v(x)=infty<=>x=0, 2. v(xy)=v(x)+v(y) forall x,y in K, and 3. ...

The doubly noncentral F-distribution describes the distribution (X/n_1)/(Y/n_2) for two independently distributed noncentral chi-squared variables X:chi_(n_1)^2(lambda_1) and ...

The norm of a mathematical object is a quantity that in some (possibly abstract) sense describes the length, size, or extent of the object. Norms exist for complex numbers ...

The integer sequence defined by the recurrence relation P(n)=P(n-2)+P(n-3) (1) with the initial conditions P(0)=P(1)=P(2)=1. This is the same recurrence relation as for the ...