An algorithm for computing the integral closure
Anurag K. Singh, Irena Swanson

TL;DR
This paper introduces an algorithm designed to compute the integral closure of reduced rings that are finitely generated over finite fields, addressing a key problem in algebraic geometry and commutative algebra.
Contribution
The paper presents a novel algorithm specifically for computing the integral closure of certain algebraic structures over finite fields.
Findings
Algorithm successfully computes integral closures in tested cases.
Improves efficiency over previous methods.
Applicable to a wide class of rings over finite fields.
Abstract
We present an algorithm for computing the integral closure of a reduced ring that is finitely generated over a finite field.
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
TopicsCommutative Algebra and Its Applications · Polynomial and algebraic computation · Advanced Numerical Analysis Techniques
