Intelligent Systems.
Theory and Applications

(Intellektual'nye Sistemy. Teoriya i Prilozheniya)

Subresultant algorithm for the greatest common divisor of polynomials with several parameters

Abstract

An algorithm is proposed that takes as input two polynomials; in addition to the primary variable (“unknown”) \(x\), these polynomials also depend on variables \(a_1, \dots , a_s\), which act as parameters that can take on various values. The study examines the greatest common divisor of the original polynomials as a function of the values assigned to these parameters.

Keywords: polynomials with parameters, subresultant chain, greatest common divisor, computer algebra.

BibTeX
@article{IS-Abramov-Ryabenko2026,
  author  = {Abramov, Sergei Aleksandrovich and Ryabenko, Anna Andreevna},
  title   = {{Subresultant algorithm for the greatest common divisor of~polynomials with several parameters}},
  journal = {Intelligent Systems. Theory and Applications},
  year    = {2026},
  volume  = {30},
  number  = {4},
  pages   = {450--453},
}
AMSBIB
\Bibitem{IS-Abramov-Ryabenko2026}
\by S.\,A.~Abramov, A.\,A.~Ryabenko
\paper Subresultant algorithm for the greatest common divisor of~polynomials with several parameters
\jour Intelligent Systems. Theory and Applications
\yr 2026
\vol 30
\issue 4
\pages 450--453
\lang In Russian
Published under Creative Commons Attribution 4.0 International (CC BY 4.0)

← Back to issue

× Issue cover