Search Results for ""

n vectors X_1, X_2, ..., X_n are linearly dependent iff there exist scalars c_1, c_2, ..., c_n, not all zero, such that sum_(i=1)^nc_iX_i=0. (1) If no such scalars exist, ...

The problem of maximizing a linear function over a convex polyhedron, also known as operations research or optimization theory. The general problem of convex optimization is ...

A proof of a formula on limits based on the epsilon-delta definition. An example is the following proof that every linear function f(x)=ax+b (a,b in R,a!=0) is continuous at ...

A system of linear differential equations (dy)/(dz)=A(z)y, (1) with A(z) an analytic n×n matrix, for which the matrix A(z) is analytic in C^_\{a_1,...,a_N} and has a pole of ...

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 ...