Search Results for ""

There exists a total computable predicate P such that for any algorithm computing P(x) with running time T(x), there exists another algorithm computing P(x) with computation ...

A second-order ordinary differential equation of the form

For a smooth harmonic map u:M->N, where del is the gradient, Ric is the Ricci curvature tensor, and Riem is the Riemann tensor.

Relates invariants of a curve defined over the integers. If this inequality were proven true, then Fermat's last theorem would follow for sufficiently large exponents. ...

A finite or infinite square matrix with rational entries. (If the matrix is infinite, all but a finite number of entries in each row must be 0.) The sum or product of two ...

For homogeneous polynomials P and Q of degree m and n, then sqrt((m!n!)/((m+n)!))[P]_2[Q]_2<=[P·Q]_2<=[P]_2[Q]_2, where [P·Q]_2 is the Bombieri norm.

The domain of Booleans, sometimes denoted B, consisting of the elements True and False, implemented in the Wolfram Language as Booleans. In the Wolfram Language, a quantity ...

Let G=SL(n,C). If lambda in Z^n is the highest weight of an irreducible holomorphic representation V of G, (i.e., lambda is a dominant integral weight), then the G-map ...

If a field has the property that, if the sets A_1, ..., A_n, ... belong to it, then so do the sets A_1+...+A_n+... and A_1...A_n..., then the field is called a Borel field ...

An occurrence of a variable in a logic which is not free. Bound variables are also called dummy variables.