Search Results for ""

Deciding whether a given Boolean formula in conjunctive normal form has an assignment that makes the formula "true." In 1971, Cook showed that the problem is NP-complete.

A diagonal matrix whose diagonal elements all contain the same scalar lambda. A scalar matrix is therefore equivalent to lambdaI, where I is the identity matrix.

If J is a simple closed curve in R^2, the closure of one of the components of R^2-J is homeomorphic with the unit 2-ball. This theorem may be proved using the Riemann mapping ...

Let a general theta function be defined as T(x,q)=sum_(n=-infty)^inftyx^nq^(n^2), then

An Auslander algebra which connects the representation theories of the symmetric group of permutations and the general linear group GL(n,C). Schur algebras are ...

The Seiberg-Witten equations are D_Apsi = 0 (1) F_A^+ = -tau(psi,psi), (2) where tau is the sesquilinear map tau:W^+×W^+->Lambda^+ tensor C.

X subset= R^n is semianalytic if, for all x in R^n, there is an open neighborhood U of x such that X intersection U is a finite Boolean combination of sets {x^_ in ...

A set is a finite or infinite collection of objects in which order has no significance, and multiplicity is generally also ignored (unlike a list or multiset). Members of a ...

A smooth map f:S^1->R^3 whose image has singularities. In particular, in the theory of Vassiliev's knot invariants, singular knots with a finite number of ordinary double ...

A skew coordinate system is a system of curvilinear coordinates in which each family of surfaces intersects the others at angles other than right angles. Skew coordinate ...