Search Results for ""

An algorithm for finding integer relations whose running time is bounded by a polynomial in the number of real variables (Ferguson and Bailey 1992). Unfortunately, it is ...

A homogeneous ideal I in a graded ring R= direct sum A_i is an ideal generated by a set of homogeneous elements, i.e., each one is contained in only one of the A_i. For ...

A rule for polynomial computation which both reduces the number of necessary multiplications and results in less numerical instability due to potential subtraction of one ...

In practice, the vertical offsets from a line (polynomial, surface, hyperplane, etc.) are almost always minimized instead of the perpendicular offsets. This provides a ...

A linear algebraic group is a matrix group that is also an affine variety. In particular, its elements satisfy polynomial equations. The group operations are required to be ...

A finite sequence of real numbers {a_k}_(k=1)^n is said to be logarithmically concave (or log-concave) if a_i^2>=a_(i-1)a_(i+1) holds for every a_i with 1<=i<=n-1. A ...

Long division is an algorithm for dividing two numbers, obtaining the quotient one digit at a time. The example above shows how the division of 123456/17 is performed to ...

The Morgan-Voyce polynomials are polynomials related to the Brahmagupta and Fibonacci polynomials. They are defined by the recurrence relations b_n(x) = ...

If the rank polynomial R(x,y) of a graph G is given by sumrho_(rs)x^ry^s, then rho_(rs) is the number of subgraphs of G with rank r and co-rank s, and the matrix (rho_(rs)) ...

If the coefficients of the polynomial d_nx^n+d_(n-1)x^(n-1)+...+d_0=0 (1) are specified to be integers, then rational roots must have a numerator which is a factor of d_0 and ...