Recursive polynomial remainder sequence and its subresultants

DOI10.1016/J.JALGEBRA.2007.12.023MaRDI QIDQ947487zbMATH OpenOpenAlexFDO

Authors Akira Terui

Publication date 6 October 2008

Published in Journal of Algebra (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/0806.0495

zbMATH Keywords

Gaussian elimination polynomial remainder sequence subresultants Sylvester's identity

Mathematics Subject Classification ID

Polynomials, factorization in commutative rings (13P05)

Abstract: We introduce concepts of "recursive polynomial remainder sequence (PRS)" and "recursive subresultant," along with investigation of their properties. A recursive PRS is defined as, if there exists the GCD (greatest common divisor) of initial polynomials, a sequence of PRSs calculated "recursively" for the GCD and its derivative until a constant is derived, and recursive subresultants are defined by determinants representing the coefficients in recursive PRS as functions of coefficients of initial polynomials. We give three different constructions of subresultant matrices for recursive subresultants; while the first one is built-up just with previously defined matrices thus the size of the matrix increases fast as the recursion deepens, the last one reduces the size of the matrix drastically by the Gaussian elimination on the second one which has a "nested" expression, i.e. a Sylvester matrix whose elements are themselves determinants.

Review text

Let \(R\) be an integral domain and \(K\) be its quotient field. Let \(F\) and \(G\) be polynomials in \(R[x]\) of degree \(m\) and \(n\) (\(m>n\)), respectively. A sequence \((P_1, \dots, P_{\ell})\) of nonzero polynomials is called a \textit{polynomial remainder sequence} (PRS) for \(F\) and \(G\) if is satisfies: \(P_1= F,\;P_2= G\) and \(\alpha_{i}P_{i-2}= q_{i-1}P_{i-1}+ \beta_{i}P_{i}\) for \(i=3, \dots, \ell,\) where \(\alpha_{1}, \dots, \alpha_{\ell},\) \(\beta_{3}, \dots, \beta_{\ell}\) are elements of \(R\) and \(\deg(P_{i-1})>\deg(P_{i}).\) In the paper under review, the author introduces concepts of ``recursive polynomial remainder sequence (see Section 2), and, he shows a recursive Sturm sequence as an example of recursive PRS (see Example 2.4). In Section 3, he defines and gives concepts of ``recursive subresultant, and, after shows its relationship to ``recursive PRS. In sections 4 and 5, he defines respectively the ``nested subresultant and ``reduced nested subresultant. At the end of this paper an approximate algebraic computation is given (briefly), by using ``reduced nested subresultant (see Section 6). Reviewer's remarks: What can one make when \(F\) and \(G\) are multivariate polynomials (i.e., \(F,\;G \in R[x_1, \dots, x_n]\) with \(n\geq 2\))? Furthermore I would like notice that an application of \textit{elimination theory} (in particular GCDs of several polynomial, Sylvester's matrix) to polynomials factorization is given in a recent paper of \textit{L. Busé, G. Chèze} and \textit{S. Najib} [``Noether's forms for the study of non-composite rational functions and their spectrum, \url{arXiv:0906.2925}] and, in another paper of \textit{A. Bodin, P. Dèbes} and \textit{S. Najib} [Acta Arith. 139, No. 1, 79--100 (2009; Zbl 1228.12002)].

Recommendations

Cites work

Cited in

(14)

This page was built for publication: Recursive polynomial remainder sequence and its subresultants

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q947487)