Papers
Topics
Authors
Recent
Search
2000 character limit reached

Persistent components in Canny's Generalized Characteristic Polynomial

Published 3 Jan 2024 in cs.SC and math.AG | (2401.01948v2)

Abstract: 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.

Authors (1)
Definition Search Book Streamline Icon: https://streamlinehq.com
References (9)
  1. Generalised characteristic polynomials. Journal of Symbolic Computation 9, 241–250. URL: https://doi.org/10.1016/S0747-7171(08)80012-0.
  2. Using Algebraic Geometry. Springer.
  3. Macaulay2, a software system for research in algebraic geometry. Available at http://www2.macaulay2.com.
  4. Introduction to commutative algebra and algebraic geometry. Birkhauser.
  5. Irredundant triangular decomposition, in: Proceedings of the 2018 ACM on International Symposium on Symbolic and Algebraic Computation, New York, NY, USA. pp. 311–318. URL: http://doi.acm.org/10.1145/3208976.3208996.
  6. Solving degenerate sparse polynomial systems faster. Journal of Symbolic Computation 28, 155–186. URL: http://dx.doi.org/10.1006/jsco.1998.0271.
  7. A package for computations with classical resultants. Journal of Software for Algebra and Geometry 8, 21–30. URL: http://dx.doi.org/10.2140/jsag.2018.8.21.
  8. Complexity of the Wu-Ritt decomposition, in: Second international symposium on parallel symbolic computation, PASCO ’97, Maui, HI, USA, July 20–22. New York, NY: ACM Press, pp. 139–149. URL: https://doi.org/10.1145/266670.266716, doi:266670.266716.
  9. Computation with polynomial systems. Ph.D. thesis. Cornell University. URL: http://www4.ncsu.edu/~aszanto/szanto.pdf.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.