TY - JOUR
T1 - Persistent components in Canny's generalized characteristic polynomial
AU - Pogudin, Gleb
N1 - Publisher Copyright:
© 2024 Elsevier Ltd
PY - 2025/5/1
Y1 - 2025/5/1
N2 - When using resultants for elimination, one standard issue is that the resultant vanishes if the variety contains components of dimension larger than the expected dimension. J. Canny proposed an elegant construction, generalized characteristic polynomial, to address this issue by symbolically perturbing the system before the resultant computation. Such perturbed resultant would typically involve artefact components only loosely related to the geometry of the variety of interest. For removing these components, J.M. Rojas proposed to take the greatest common divisor of the results of two different perturbations. In this paper, we investigate this construction, and show that the extra components persistent under taking different perturbations must come either from singularities or from positive-dimensional fibers.
AB - When using resultants for elimination, one standard issue is that the resultant vanishes if the variety contains components of dimension larger than the expected dimension. J. Canny proposed an elegant construction, generalized characteristic polynomial, to address this issue by symbolically perturbing the system before the resultant computation. Such perturbed resultant would typically involve artefact components only loosely related to the geometry of the variety of interest. For removing these components, J.M. Rojas proposed to take the greatest common divisor of the results of two different perturbations. In this paper, we investigate this construction, and show that the extra components persistent under taking different perturbations must come either from singularities or from positive-dimensional fibers.
KW - Generalized characteristic polynomial
KW - Resultant
KW - Syzygies
U2 - 10.1016/j.jsc.2024.102397
DO - 10.1016/j.jsc.2024.102397
M3 - Article
AN - SCOPUS:85207781245
SN - 0747-7171
VL - 128
JO - Journal of Symbolic Computation
JF - Journal of Symbolic Computation
M1 - 102397
ER -