Search Results for ""

Let L_n be the n×n matrix whose (i,j)th entry is 1 if j divides i and 0 otherwise, let Phi_n be the n×n diagonal matrix diag(phi(1),phi(2),...,phi(n)), where phi(n) is the ...

Tarski's theorem says that the first-order theory of reals with +, *, =, and > allows quantifier elimination. Algorithmic quantifier elimination implies decidability assuming ...

A distribution with zero kurtosis excess, i.e., gamma_2=0.

A unigraphic graph (or simply a "unigraph") is a graph that is isomorphic to every graph having that degree sequence. All graphs on four are fewer vertices are unigraphic. ...

An injective module is the dual notion to the projective module. A module M over a unit ring R is called injective iff whenever M is contained as a submodule in a module N, ...

A projective module generalizes the concept of the free module. A module M over a nonzero unit ring R is projective iff it is a direct summand of a free module, i.e., of some ...

The differential forms on C^n decompose into forms of type (p,q), sometimes called (p,q)-forms. For example, on C, the exterior algebra decomposes into four types: ^ C = ^ ^0 ...

A matrix, also called a canonical box matrix, having zeros everywhere except along the diagonal and superdiagonal, with each element of the diagonal consisting of a single ...

The Jordan canonical form, also called the classical canonical form, of a special type of block matrix in which each block consists of Jordan blocks with possibly differing ...

In n-dimensional Lorentzian space R^n=R^(1,n-1), the light cone C^(n-1) is defined to be the subset consisting of all vectors x=(x_0,x_1,...,x_(n-1)) (1) whose squared ...