Algorithms in the classical N\'eron Desingularization
Asma Khalid, Adrian Popescu, Dorin Popescu
TL;DR
This paper presents algorithms for constructing the Néron Desingularization and its simplified case, providing computational methods for a classical algebraic geometry process.
Contribution
It introduces algorithms for the Néron Desingularization and simplifies the process for the easy case, advancing computational approaches in algebraic geometry.
Findings
Algorithms successfully construct Néron Desingularization.
Simplified method for the easy case improves efficiency.
Provides computational tools for algebraic geometry applications.
Abstract
We give algorithms to construct the N\'eron Desingularization and the easy case from \cite{KK} of the General N\'eron Desingularization.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAlgebraic Geometry and Number Theory · Advanced Algebra and Geometry · Homotopy and Cohomology in Algebraic Topology