Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 43 tok/s
Gemini 2.5 Pro 48 tok/s Pro
GPT-5 Medium 21 tok/s Pro
GPT-5 High 20 tok/s Pro
GPT-4o 95 tok/s Pro
Kimi K2 180 tok/s Pro
GPT OSS 120B 443 tok/s Pro
Claude Sonnet 4.5 32 tok/s Pro
2000 character limit reached

A Geometric Approach to Cylindrical Algebraic Decomposition (2311.10515v5)

Published 17 Nov 2023 in math.AG, cs.SC, and math.AC

Abstract: Cylindrical algebraic decomposition is a classical construction in real algebraic geometry. Although there are many algorithms to compute a cylindrical algebraic decomposition, their practical performance is still very limited. In this paper, we revisit this problem from a more geometric perspective, where the construction of cylindrical algebraic decomposition is related to the study of morphisms between real varieties. It is showed that the geometric fiber cardinality (geometric property) decides the existence of semi-algebraic continuous sections (semi-algebraic property). As a result, all equations can be systematically exploited in the projection phase, leading to a new simple algorithm whose efficiency is demonstrated by experimental results.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (68)
  1. Real algebraic geometry, volume 36. Springer Science & Business Media, 2013.
  2. The complexity of quantifier elimination and cylindrical algebraic decomposition. In Proceedings of the 2007 International Symposium on Symbolic and Algebraic Computation, ISSAC ’07, page 54–60, New York, NY, USA, 2007. Association for Computing Machinery.
  3. Truth table invariant cylindrical algebraic decomposition. Journal of Symbolic Computation, 76:1–35, 2016.
  4. Eberhard Becker. Sums of squares and quadratric forms in real algebraic geometry. Cahiers du séminaire d’histoire des mathématiques, 1:41–57, 1991.
  5. On the complexity of the f5 Gröbner basis algorithm. Journal of Symbolic Computation, 70:49–70, 2015.
  6. Speeding-up quantifier elimination by Gröbner bases. Citeseer, 1991.
  7. The complexity of elementary algebra and geometry. In Proceedings of the sixteenth annual ACM symposium on Theory of computing, pages 457–464, 1984.
  8. Algorithms in Real Algebraic Geometry (Algorithms and Computation in Mathematics). Springer-Verlag, Berlin, Heidelberg, 2006.
  9. Christopher W Brown. Improved projection for cylindrical algebraic decomposition. Journal of Symbolic Computation, 32(5):447–465, 2001.
  10. Christopher W Brown. Qepcad b: a program for computing with semi-algebraic sets using cads. ACM Sigsam Bulletin, 37(4):97–108, 2003.
  11. Bruno Buchberger. Ein algorithmus zum auffinden der basiselemente des restklassenringes nach einem nulldimensionalen polynomideal. Ph. D. Thesis, Math. Inst., University of Innsbruck, 1965.
  12. Bruno Buchberger. Ein algorithmisches kriterium für die lösbarkeit eines algebraischen gleichungssystems. Aequationes math, 4(3):374–383, 1970.
  13. On the trace formula for quadratic forms. Contemporary Mathematics, 155:271–291, 1994.
  14. Partial cylindrical algebraic decomposition for quantifier elimination. Journal of Symbolic Computation, 12(3):299–328, 1991.
  15. Ideals, varieties, and algorithms: an introduction to computational algebraic geometry and commutative algebra. Springer Science & Business Media, 2013.
  16. An incremental algorithm for computing cylindrical algebraic decompositions. In Computer Mathematics: 9th Asian Symposium (ASCM2009), Fukuoka, December 2009, 10th Asian Symposium (ASCM2012), Beijing, October 2012, Contributed Papers and Invited Talks, pages 199–221. Springer, 2014.
  17. Computing cylindrical algebraic decomposition via triangular decomposition. In Proceedings of the 2009 international symposium on Symbolic and algebraic computation, pages 95–102, 2009.
  18. George E Collins. Quantifier elimination for real closed fields by cylindrical algebraic decompostion. In Automata Theory and Formal Languages: 2nd GI Conference Kaiserslautern, May 20–23, 1975, pages 134–183. Springer, 1975.
  19. George E Collins. Quantifier elimination by cylindrical algebraic decomposition—twenty years of progress. Quantifier elimination and cylindrical algebraic decomposition, pages 8–23, 1998.
  20. David A Cox. Stickelberger and the eigenvalue theorem. In Commutative Algebra: Expository Papers Dedicated to David Eisenbud on the Occasion of his 75th Birthday, pages 283–298. Springer, 2021.
  21. Singular 4-2-1 — A computer algebra system for polynomial computations. http://www.singular.uni-kl.de, 2021.
  22. Real quantifier elimination is doubly exponential. J. Symb. Comput., 5(1–2):29–35, feb 1988.
  23. Cylindrical algebraic decomposition with equational constraints. Journal of Symbolic Computation, 100:38–71, 2020.
  24. The geometry of schemes, volume 197. Springer Science & Business Media, 2006.
  25. Direct methods for primary decomposition. Inventiones mathematicae, 110(1):207–235, 1992.
  26. David Eisenbud. Commutative algebra: with a view toward algebraic geometry, volume 150. Springer Science & Business Media, 2013.
  27. Jean Charles Faugere. A new efficient algorithm for computing Gröbner bases without reduction to zero (f 5). In Proceedings of the 2002 international symposium on Symbolic and algebraic computation, pages 75–83, 2002.
  28. Jean-Charles Faugère. Fgb: a library for computing Gröbner bases. In International Congress on Mathematical Software, pages 84–87. Springer, 2010.
  29. Real quantifier elimination by computation of comprehensive Gröbner systems. In Proceedings of the 2015 ACM on International Symposium on Symbolic and Algebraic Computation, pages 173–180, 2015.
  30. A SINGULAR introduction to commutative algebra, volume 348. Springer, 2008.
  31. Alexander Grothendieck. Éléments de géométrie algébrique: Iv. étude locale des schémas et des morphismes de schémas, seconde partie. Publications Mathématiques de l’IHÉS, 24:5–231, 1965.
  32. Gröbner bases and primary decomposition of polynomial ideals. Journal of Symbolic Computation, 6(2-3):149–167, 1988.
  33. Alan G Hamilton. Logic for mathematicians. Cambridge University Press, 1988.
  34. Robin Hartshorne. Algebraic geometry, volume 52. Springer Science & Business Media, 1977.
  35. Using machine learning to decide when to precondition cylindrical algebraic decomposition with Groebner bases. In 2016 18th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing (SYNASC), pages 45–52. IEEE, 2016.
  36. Hoon Hong. An improvement of the projection operator in cylindrical algebraic decomposition. In Proceedings of the international symposium on Symbolic and algebraic computation, pages 261–264, 1990.
  37. Hoon Hong. Comparison of several decision algorithms for the existential theory of the reals. Citeseer, 1991.
  38. Michael Kalkbrener. On the stability of Gröbner bases under specializations. Journal of Symbolic Computation, 24(1):51–58, 1997.
  39. Gregor Kemper. A course in commutative algebra, volume 256. Springer, 2011.
  40. Y. N. Lakshman. A Single Exponential Bound on the Complexity of Computing Gröbner Bases of Zero Dimensional Ideals, pages 227–234. Birkhäuser Boston, Boston, MA, 1991.
  41. Daniel Lazard. An improved projection for cylindrical algebraic decomposition. In Algebraic geometry and its applications: collections of papers from Shreeram S. Abhyankar’s 60th birthday conference, pages 467–476. Springer, 1994.
  42. Solving parametric systems of polynomial equations over the reals through hermite matrices. Journal of Symbolic Computation, 112:25–61, 2022.
  43. Qing Liu. Algebraic geometry and arithmetic curves, volume 6. Oxford Graduate Texts in Mathematics, 2002.
  44. On the Complexity of Zero-dimensional Algebraic Systems, pages 217–225. Birkhäuser Boston, Boston, MA, 1991.
  45. Solving parametric polynomial systems. Journal of Symbolic Computation, 42(6):636–667, 2007.
  46. A survey on algorithms for computing comprehensive Gröbner systems and comprehensive Gröbner bases. Journal of Systems Science and Complexity, 32:234–255, 2019.
  47. Frédéric Mangolte. Real algebraic varieties. Springer, 2020.
  48. Ernst Mayr. Membership in polynomial ideals over q is exponential space complete. In B. Monien and R. Cori, editors, STACS 89, pages 400–406, Berlin, Heidelberg, 1989. Springer Berlin Heidelberg.
  49. Scott McCallum. An improved projection operation for cylindrical algebraic decomposition of three-dimensional space. Journal of Symbolic Computation, 5(1-2):141–161, 1988.
  50. Scott McCallum. An improved projection operation for cylindrical algebraic decomposition. In Quantifier Elimination and Cylindrical Algebraic Decomposition, pages 242–268. Springer, 1998.
  51. Scott McCallum. On projection in cad-based quantifier elimination with equational constraint. In Proceedings of the 1999 international symposium on Symbolic and algebraic computation, pages 145–149, 1999.
  52. Scott McCallum. On propagation of equational constraints in cad-based quantifier elimination. In Proceedings of the 2001 international symposium on Symbolic and algebraic computation, pages 223–231, 2001.
  53. The complexity of the word problems for commutative semigroups and polynomial ideals. Advances in Mathematics, 46(3):305–329, 1982.
  54. H Michael Möller. On the construction of Gröbner bases using syzygies. Journal of Symbolic Computation, 6(2-3):345–359, 1988.
  55. Validity proof of lazard’s method for cad construction. Journal of Symbolic Computation, 92:52–69, 2019.
  56. Degree bounds for Gröbner bases of low-dimensional polynomial ideals. In Proceedings of the 2010 International Symposium on Symbolic and Algebraic Computation, ISSAC ’10, page 21–27, New York, NY, USA, 2010. Association for Computing Machinery.
  57. Dimension-dependent bounds for Gröbner bases of polynomial ideals. Journal of Symbolic Computation, 49:78–94, 2013. The International Symposium on Symbolic and Algebraic Computation.
  58. Paul Christian Pedersen. Counting real zeros. New York University, 1991.
  59. Counting real zeros in the multivariate case. In Computational algebraic geometry, pages 203–224. Springer, Birkhäuser Boston, MA, 1993.
  60. A simple algorithm to compute comprehensive Gröbner bases using Gröbner bases. In Proceedings of the 2006 international symposium on Symbolic and Algebraic Computation, pages 326–331, 2006.
  61. Localization and primary decomposition of polynomial ideals. Journal of Symbolic Computation, 22(3):247–277, 1996.
  62. A. Tarski. A Decision Method for Elementary Algebra and Geometry. University of California Press, 1951.
  63. Speeding up cylindrical algebraic decomposition by Gröbner bases. In International Conference on Intelligent Computer Mathematics, pages 280–294. Springer, 2012.
  64. Decomposition of polynomial sets into characteristic pairs. Mathematics of Computation, 89(324):1993–2015, 2020.
  65. Volker Weispfenning. The complexity of linear problems in fields. Journal of symbolic computation, 5(1-2):3–27, 1988.
  66. Volker Weispfenning. Comprehensive Gröbner bases. Journal of symbolic computation, 14(1):1–29, 1992.
  67. Volker Weispfenning. A new approach to quantifier elimination for real algebra. In Quantifier Elimination and Cylindrical Algebraic Decomposition, pages 376–392. Springer, 1998.
  68. Lu Yang and Bican Xia. Real solution classification for parametric semi-algebraic systems. In Algorithmic Algebra and Logic, pages 281–289, 2005.
Citations (1)
View on Semantic Scholar

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now
Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

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

Ai Sparkles Streamline Icon: https://streamlinehq.com Generate Now

Authors (1)

  1. Rizeng Chen
List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

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

User Circle Single Streamline Icon: https://streamlinehq.com Sign Up

Don't miss out on important new AI/ML research

See which papers are being discussed right now on X, Reddit, and more:

Explore Trending Papers

“Emergent Mind helps me see which AI papers have caught fire online.”

Philip

Philip

Creator, AI Explained on YouTube