# On the Remainders Obtained in Finding the Greatest Common Divisor of Two Polynomials

Akritas, Alkiviadis; Malaschonok, Gennadi; Vigklas, Panagiotis

Serdica Journal of Computing (2015)

- Volume: 9, Issue: 2, page 123-138
- ISSN: 1312-6555

## Access Full Article

top## Abstract

top## How to cite

topAkritas, Alkiviadis, Malaschonok, Gennadi, and Vigklas, Panagiotis. "On the Remainders Obtained in Finding the Greatest Common Divisor of Two Polynomials." Serdica Journal of Computing 9.2 (2015): 123-138. <http://eudml.org/doc/281369>.

@article{Akritas2015,

abstract = {In 1917 Pell (1) and Gordon used sylvester2, Sylvester’s little
known and hardly ever used matrix of 1853, to compute(2)
the coefficients of a Sturmian remainder — obtained in applying in Q[x],
Sturm’s algorithm on two polynomials f, g ∈ Z[x] of degree n — in terms of
the determinants (3) of the corresponding submatrices of sylvester2.
Thus, they solved a problem that had eluded both J. J. Sylvester, in 1853,
and E. B. Van Vleck, in 1900. (4)
In this paper we extend the work by Pell and Gordon and show how to compute (2)
the coefficients of an Euclidean remainder — obtained in finding in Q[x],
the greatest common divisor of f, g ∈ Z[x] of degree n — in terms of
the determinants (5) of the corresponding submatrices of sylvester1,
Sylvester’s widely known and used matrix of 1840.
(1) See the link http://en.wikipedia.org/wiki/Anna\_Johnson\_Pell\_Wheeler for her biography
(2) Both for complete and incomplete sequences, as defined in the sequel.
(3) Also known as modified subresultants.
(4) Using determinants Sylvester and Van Vleck were able to compute the coefficients
of Sturmian remainders only for the case of complete sequences.
(5) Also known as (proper) subresultants.},

author = {Akritas, Alkiviadis, Malaschonok, Gennadi, Vigklas, Panagiotis},

journal = {Serdica Journal of Computing},

keywords = {Polynomial Remainder Sequence (PRS); Sylvester’s Matrices; Euclidean PRS; Subresultant PRS; Sturm Sequence; Modified Subresultant PRS},

language = {eng},

number = {2},

pages = {123-138},

publisher = {Institute of Mathematics and Informatics Bulgarian Academy of Sciences},

title = {On the Remainders Obtained in Finding the Greatest Common Divisor of Two Polynomials},

url = {http://eudml.org/doc/281369},

volume = {9},

year = {2015},

}

TY - JOUR

AU - Akritas, Alkiviadis

AU - Malaschonok, Gennadi

AU - Vigklas, Panagiotis

TI - On the Remainders Obtained in Finding the Greatest Common Divisor of Two Polynomials

JO - Serdica Journal of Computing

PY - 2015

PB - Institute of Mathematics and Informatics Bulgarian Academy of Sciences

VL - 9

IS - 2

SP - 123

EP - 138

AB - In 1917 Pell (1) and Gordon used sylvester2, Sylvester’s little
known and hardly ever used matrix of 1853, to compute(2)
the coefficients of a Sturmian remainder — obtained in applying in Q[x],
Sturm’s algorithm on two polynomials f, g ∈ Z[x] of degree n — in terms of
the determinants (3) of the corresponding submatrices of sylvester2.
Thus, they solved a problem that had eluded both J. J. Sylvester, in 1853,
and E. B. Van Vleck, in 1900. (4)
In this paper we extend the work by Pell and Gordon and show how to compute (2)
the coefficients of an Euclidean remainder — obtained in finding in Q[x],
the greatest common divisor of f, g ∈ Z[x] of degree n — in terms of
the determinants (5) of the corresponding submatrices of sylvester1,
Sylvester’s widely known and used matrix of 1840.
(1) See the link http://en.wikipedia.org/wiki/Anna_Johnson_Pell_Wheeler for her biography
(2) Both for complete and incomplete sequences, as defined in the sequel.
(3) Also known as modified subresultants.
(4) Using determinants Sylvester and Van Vleck were able to compute the coefficients
of Sturmian remainders only for the case of complete sequences.
(5) Also known as (proper) subresultants.

LA - eng

KW - Polynomial Remainder Sequence (PRS); Sylvester’s Matrices; Euclidean PRS; Subresultant PRS; Sturm Sequence; Modified Subresultant PRS

UR - http://eudml.org/doc/281369

ER -

## NotesEmbed ?

topTo embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.