Search Results for ""

A number t_x=tan^(-1)(1/x)=cot^(-1)x, where x is an integer or rational number, tan^(-1)x is the inverse tangent, and cot^(-1)x is the inverse cotangent. Gregory numbers ...

A binary Hamming code H_r of length n=2^r-1 (with r>=2) is a linear code with parity-check matrix H whose columns consist of all nonzero binary vectors of length r, each used ...

A Hilbert basis for the vector space of square summable sequences (a_n)=a_1, a_2, ... is given by the standard basis e_i, where e_i=delta_(in), with delta_(in) the Kronecker ...

Let G be a group, then there exists a piecewise linear knot K^(n-2) in S^n for n>=5 with G=pi_1(S^n-K) iff G satisfies 1. G is finitely presentable, 2. The Abelianization of ...

Let Q_i denote anything subject to weighting by a normalized linear scheme of weights that sum to unity in a set W. The Kolmogorov axioms state that 1. For every Q_i in W, ...

Given a Lyapunov characteristic exponent sigma_i, the corresponding Lyapunov characteristic number lambda_i is defined as lambda_i=e^(sigma_i). (1) For an n-dimensional ...

A linear real-valued function omega^1 of vectors v such that omega^1(v)|->R. Vectors (i.e., contravariant vectors or "kets" |psi>) and one-forms (i.e., covariant vectors or ...

A pullback is a general categorical operation appearing in a number of mathematical contexts, sometimes going under a different name. If T:V->W is a linear transformation ...

The Rabinovich-Fabrikant equation is the set of coupled linear ordinary differential equations given by x^. = y(z-1+x^2)+gammax (1) y^. = x(3z+1-x^2)+gammay (2) z^. = ...

An algorithm that can always be used to decide whether a given polynomial is free of zeros in the closed unit disk (or, using an entire linear transformation, to any other ...