Search Results for ""

If M^n is a finite simplicial complex of dimension n>=5 that has the homotopy type of the sphere S^n and is locally piecewise linearly homeomorphic to the Euclidean space ...

A square with side lengths 1. The unit square usually means the one with coordinates (0, 0), (1, 0), (1, 1), (0, 1) in the real plane, or 0, 1, 1+i, and i in the complex ...

If K is a simplicial complex, let V be the vertex set of K. Furthermore, let K be the collection of all subsets {a_0,...,a_n} of V such that the vertices a_0, ..., a_n span a ...

The system of partial differential equations (partial_t+partial_z^3+partial_(z^_)^3)v+partial_z(uv)+partial_(z^_)(vw) (1) partial_(z^_)u=3partial_zv (2) ...

Let f be a family of meromorphic functions on the unit disk D which are not normal at 0. Then there exist sequences f_n in F, z_n, rho_n, and a nonconstant function f ...

An algorithm which finds a polynomial recurrence for terminating hypergeometric identities of the form sum_(k)(n; ...

A k-matrix is a kind of cube root of the identity matrix (distinct from the identity matrix) which is defined by the complex matrix k=[0 0 -i; i 0 0; 0 1 0]. It satisfies ...

A (0,1)-matrix is an integer matrix in which each element is a 0 or 1. It is also called a logical matrix, binary matrix, relation matrix, or Boolean matrix. The number of ...

For discrete problems in which no efficient solution method is known, it might be necessary to test each possibility sequentially in order to determine if it is the solution. ...

In August 2002, M. Agrawal and colleagues announced a deterministic algorithm for determining if a number is prime that runs in polynomial time (Agrawal et al. 2004). While ...