Search Results for ""

The plane determined by the points x_1, x_2, and x_3 and the line passing through the points x_4 and x_5 intersect in a point which can be determined by solving the four ...

The line bisecting a given line segment P_1P_2 can be constructed geometrically, as illustrated above.

A line bundle is a special case of a vector bundle in which the fiber is either R, in the case of a real line bundle, or C, in the case of a complex line bundle.

The negative pedal curve of a line specified parametrically by x = at (1) y = 0 (2) is given by x_n = 2at-x (3) y_n = ((x-at)^2)/y, (4) which is a parabola.

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

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

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