Search Results for ""

For homogeneous polynomials P and Q of degree m and n, then sqrt((m!n!)/((m+n)!))[P]_2[Q]_2<=[P·Q]_2<=[P]_2[Q]_2, where [P·Q]_2 is the Bombieri norm.

An algebraic surface which can be represented implicitly by a polynomial of degree 10 in x, y, and z. An example is the Barth decic.

Given two circles, draw the tangents from the center of each circle to the sides of the other. Then the line segments AB and CD are of equal length. The theorem can be proved ...

f(x) approx t_n(x)=sum_(k=0)^(2n)f_kzeta_k(x), where t_n(x) is a trigonometric polynomial of degree n such that t_n(x_k)=f_k for k=0, ..., 2n, and ...

Let rho(x) be an mth degree polynomial which is nonnegative in [-1,1]. Then rho(x) can be represented in the form {[A(x)]^2+(1-x^2)[B(x)]^2 for m even; ...

Neville's algorithm is an interpolation algorithm which proceeds by first fitting a polynomial of degree 0 through the point (x_k,y_k) for k=1, ..., n, i.e., P_k(x)=y_k. A ...

A quadratic recurrence is a recurrence equation on a sequence of numbers {x_n} expressing x_n as a second-degree polynomial in x_k with k<n. For example, x_n=x_(n-1)x_(n-2) ...

If f is a continuous real-valued function on [a,b] and if any epsilon>0 is given, then there exists a polynomial p on [a,b] such that |f(x)-P(x)|<epsilon for all x in [a,b]. ...

The Chebotarev density theorem is a complicated theorem in algebraic number theory which yields an asymptotic formula for the density of prime ideals of a number field K that ...

The pure equation x^p=C of prime degree p is irreducible over a field when C is a number of the field but not the pth power of an element of the field. Jeffreys and Jeffreys ...