Search Results for ""

Let F(n) be a family of partitions of n and let F(n,d) denote the set of partitions in F(n) with Durfee square of size d. The Durfee polynomial of F(n) is then defined as the ...

If A is an n×n square matrix and lambda is an eigenvalue of A, then the union of the zero vector 0 and the set of all eigenvectors corresponding to eigenvalues lambda is ...

Let t be an infinite word over a finite alphabet Sigma. Then there exists a uniformly recurrent infinite word r such that Sub(r) subset= Sub(t), where Sub(w) is the set of ...

A global maximum, also known as an absolute maximum, the largest overall value of a set, function, etc., over its entire range. It is impossible to construct an algorithm ...

A global minimum, also known as an absolute minimum, is the smallest overall value of a set, function, etc., over its entire range. It is impossible to construct an algorithm ...

Given a set V of m vectors (points in R^n), the Gram matrix G is the matrix of all possible inner products of V, i.e., g_(ij)=v_i^(T)v_j. where A^(T) denotes the transpose. ...

The kernel of a group homomorphism f:G-->G^' is the set of all elements of G which are mapped to the identity element of G^'. The kernel is a normal subgroup of G, and always ...

Let u_1<=u_2<=... be harmonic functions on a connected open set U subset= C. Then either u_j->infty uniformly on compact sets or there is a finite-values harmonic function u ...

Let K be a number field with ring of integers R and let A be a nontrivial ideal of R. Then the ideal class of A, denoted [A], is the set of fractional ideals B such that ...

Conditions at an initial time t=t_0 from which a given set of mathematical equations or physical system evolves. A system with initial conditions specified is known as an ...