Search Results for ""

A linear code over a finite field with q elements F_q is a linear subspace C subset F_q^n. The vectors forming the subspace are called codewords. When codewords are chosen ...

A sum of the elements from some set with constant coefficients placed in front of each. For example, a linear combination of the vectors x, y, and z is given by ax+by+cz, ...

A linear functional on a real vector space V is a function T:V->R, which satisfies the following properties. 1. T(v+w)=T(v)+T(w), and 2. T(alphav)=alphaT(v). When V is a ...

Any linear system of point-groups on a curve with only ordinary singularities may be cut by adjoint curves.

A subset M of a Hilbert space H is a linear manifold if it is closed under addition of vectors and scalar multiplication.

Linear programming, sometimes known as linear optimization, is the problem of maximizing or minimizing a linear function over a convex polyhedron specified by linear and ...

The kernel of a linear transformation T:V-->W between vector spaces is its null space.

Two curves phi and psi satisfying phi+psi=0 are said to be linearly dependent. Similarly, n curves phi_i, i=1, ..., n are said to be linearly dependent if sum_(i=1)^nphi_i=0.

Sequences x_n^((1)), x_n^((2)), ..., x_n^((k)) are linearly dependent if constants c_1, c_2, ..., c_k (not all zero) exist such that sum_(i=1)^kc_ix_n^((i))=0 for n=0, 1, ....

Two or more functions, equations, or vectors f_1, f_2, ..., which are not linearly dependent, i.e., cannot be expressed in the form a_1f_1+a_2f_2+...+a_nf_n=0 with a_1, a_2, ...