Search Results for ""

A polynomial factorization algorithm that proceeds by considering the vector of coefficients of a polynomial P, calculating b_i=P(i)/a_i, constructing the Lagrange ...

A lag system, introduced by Wang (1963), is a sort of opposite to a tag system. Lag systems allow dependence on more than just the first element, but remove only the first ...

A quantity involving primitive cube roots of unity which can be used to solve the cubic equation.

A spectrum formed by the Lagrange numbers. The only ones less than three are the Lagrange numbers, but the last gaps end at Freiman's constant. Real numbers larger than ...

The numbers B_(n,k)(1!,2!,3!,...)=(n-1; k-1)(n!)/(k!), where B_(n,k) is a Bell polynomial.

Let a graph G have exactly 2n-3 graph edges, where n is the number of graph vertices in G. Then G is "generically" rigid in R^2 iff e^'<=2n^'-3 for every subgraph of G having ...

A root-finding algorithm also called Bailey's method and Hutton's method. For a function of the form g(x)=x^d-r, Lambert's method gives an iteration function ...

An algorithm for computing the eigenvalues and eigenvectors for large symmetric sparse matrices.

The conjecture that the Artin L-function of any n-dimensional complex representation of the Galois group of a finite extension of the rational numbers Q is an Artin ...

An algorithm which isolates roots in the complex plane by generalizing one-dimensional bracketing.