Search Results for ""

A tensor-like coefficient which gives the difference between partial derivatives of two coordinates with respect to the other coordinate, ...

A function f(x) is said to be constructible if some algorithm F computes it, in binary, within volume O(f(x)), i.e., V_(F(x))=O(f(x)). Here, the volume V_(A(x)) is the ...

The study of definable sets and functions in polish spaces.

10^(18) bytes. Unfortunately, the term is sometimes also used to mean 2^(60)=1024^6 bytes. However, the latter usage is deprecated, and the term exbibyte is preferred for ...

A finite geometry is a geometry with a finite number of points. When confined to a plane, all finite geometries are either projective plane geometries (with no parallel ...

Given a differential p-form q in the exterior algebra ^ ^pV^*, its envelope is the smallest subspace W such that q is in the subspace ^ ^pW^* subset ^ ^pV^*. Alternatively, W ...

Frequency representation is the notation (1^(a_1)2^(a_2)...) used to abbreviate a partition {1,...,1_()_(a_1),2,...,2_()_(a_2),...} (Andrews 1998, p. 1).

A loop of an graph is degenerate edge that joins a vertex to itself, also called a self-loop. A simple graph cannot contain any loops, but a pseudograph can contain both ...

A honeycomb-like packing that forms hexagons.

A figurate number which is equal to the cubic number n^3. The first few are 1, 8, 27, 64, ... (OEIS A000578).