Results 21 to 30 of about 187 (52)
B\'ezout Subresultants for Univariate Polynomials in General Basis
Subresultant is a powerful tool for developing various algorithms in computer algebra. Subresultants for polynomials in standard basis (i.e., power basis) have been well studied so far.
Yang, Jing, Yang, Wei
core
Subresultants and locally nilpotent derivations [PDF]
In this paper we establish a connection between subresultants and locally nilpotent derivations over commutative rings containing the rationals. As consequence of this connection, we prove that for any commutative ring with unit and any polynomials P ...
El Kahoui, M. +3 more
core +1 more source
Scalar q-subresultants and Dickson matrices [PDF]
Following the ideas of Ore and Li we study q-analogues of scalar subresultants and show how these results can be applied to determine the rank of a GF(q)-linear transformation f of GF(q^n).
Csajbók, Bence, Bence Csajbok
core +1 more source
Subresultants in multiple roots [PDF]
We extend our previous work on Poisson-like formulas for subresultants in roots to the case of polynomials with multiple roots in both the univariate and multivariate case, and also explore some closed formulas in roots for univariate polynomials in this
Szanto, Agnes +2 more
core +1 more source
Subresultants of two Hermite–Laurent series [PDF]
Subresultants appear to be approximants of the resultant, and can be defined, in the univariate case so far, for a couple of Laurent series while the concept of resultant does no longer make sense.
Apéry, François
core +1 more source
A Note on Subresultants and the Lazard/Rioboo/Trager Formula in Rational Function Integration [PDF]
An ambiguity in a formula of Lazard, Rioboo and Trager, connecting subresultants and rational function integration, is indicated and examples of incorrect interpretations are ...
MULDERS, THOM
core +1 more source
Resultants and subresultants of p-adic polynomials
We address the problem of the stability of the computations of resultants and subresultants of polynomials defined over complete discrete valuation rings (e.g. Zp or k[[t]] where k is a field). We prove that Euclide-like algorithms are highly unstable on
Caruso, Xavier
core +2 more sources
Subresultants of $(x-\alpha)^m$ and $(x-\beta)^n$, Jacobi polynomials and complexity [PDF]
International audienceIn an earlier article together with Carlos D'Andrea [BDKSV2017], we describedexplicit expressions for the coefficients of the order-$d$ polynomialsubresultant of $(x-\alpha)^m$ and $(x-\beta)^n $ with respect to Bernstein'sset of ...
Bostan, Alin +6 more
core +1 more source
Factorization of KdV Schrödinger operators using differential subresultants
We address the classical factorization problem of a one dimensional Schrödinger operator −∂2+u−λ, for a stationary potential u of the KdV hierarchy but, in this occasion, a “parameter” λ is considered.
Morales-Ruiz, Juan J. +2 more
core +1 more source
Formulas in roots for the subresultants [PDF]
Los objetos centrales de esta tesis son los polinomios subresultantes de dos polinomios en una variable, que son, en el caso de polinomios con raíces simples, múltiplos escalares de lo que hoy se llama sumas de Sylvester de sus conjuntos de raíces, como ...
Valdettaro, Marcelo Alejandro
core +2 more sources

