Search Results for ""

A linear approximation to a function f(x) at a point x_0 can be computed by taking the first term in the Taylor series f(x_0+Deltax)=f(x_0)+f^'(x_0)Deltax+....

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

A curve on a surface whose tangents are always in the direction of principal curvature. The equation of the lines of curvature can be written |g_(11) g_(12) g_(22); b_(11) ...

A planar diagram depicting a link (or knot) as a sequence of segments with gaps representing undercrossings and solid lines overcrossings. In such a diagram, only two ...

The span of an unoriented link diagram (also called the link spread) is the difference between the highest and lowest degrees of its bracket polynomial. The span is a ...

The links curve is the quartic curve given by the Cartesian equation (x^2+y^2-3x)^2=4x^2(2-x). (1) The area enclosed by the outer envelope is A_(envelope)=1/6(9pi+8) (2) and ...