sylvesterSequence(f,g)
This computes the reduced Sylvester sequence of two univariate polynomials with rational coefficients f and g in the same ring. This begins with the Sylvester sequence $(f_{0},f_{1},\dots,f_{k})$, where $f_{0} = f, f_{1} = f'\cdot g$ and for $i\geq 1, f_{i+1} = -1\cdot$remainder $(f_{i-1},f_{i})$. The last nonzero remainder $f_{k}$ is a greatest common divisor of $f$ and $g$. The reduced Sylvester sequence is obtained by dividing each term of the Sylvester sequence by $f_{k}$.
|
|
|
|
The object sylvesterSequence is a method function.
The source of this document is in /build/reproducible-path/macaulay2-1.25.06+ds/M2/Macaulay2/packages/RealRoots.m2:773:0.