## Doing explicit computations with coordinate rings

### Remember to vote up questions/answers you find interesting or helpful (requires 15 reputation points)

Suppose that we are given an integral $k$-algebra $A$ of finite type explicitly, by which I mean that we are given the generators of the defining ideal $J$ where $A = k[x_1,...,x_n]/J$. What kinds of tools are out there to compute the integral closure of $A$? I would like the answer as explicitly as possible i.e. generators of the defining ideal.

While suggestions of computer programs are welcome, I want to be able to do these on my own, so I am looking for results which let me prove the answer. I'm asking from the perspective of someone who knows very little computational commutative algebra.

As a related question, if I have two such rings $A$, $B$ given explicitly as above, together with an explicit homomorphism between them, how can I go about determining the kernel and cokernel explicitly? Also, how about if we localize everything at a maximal ideal?

Broadly speaking, I would like to know about what kinds of computational methods are available for rings which arise from studying complex algebraic varieties. Have people out there settled these kinds of computations completely, or is this a hard question in general?

-

1
Related: mathoverflow.net/questions/11709/… – David Speyer Feb 20 2011 at 15:03

## 2 Answers

This should be what you're looking for.

-

### You can accept an answer to one of your own questions by clicking the check mark next to it. This awards 15 reputation points to the person who answered and 2 reputation points to you.

Have you looked at the Swanson-Huneke book on integral closure? Especially chapter 15 which is a discussion of various methods of computing integral closure (including Stolzenberg's method mentioned in Steven Landsberg's answer above).
It is available online HERE

Another recent algorithm is due to A. Singh and I. Swanson, Click HERE. This also has some history discussion, and it is apparently implemented as well.

Since you did ask for computer implementations, please see HERE, an algorithm implemented in Macaulay2 apparently based off T. de Jong's algorithm (mentioned in the sources above).

Finally, I should note that sometimes blowing-up the conductor helps, see section 7 of Greco-Traverso, On seminormal schemes''.

EDIT: With regards to your other questions finding kernels and cokernels of maps of rings, you should see a book on computational commutative algebra. For example, you could try the section of Eisenbud's book "Commutative Algebra with a view towards algebraic geometry'' on Groebner bases, another common source is Ideals, Varieties and Algorithms" by Cox, Litlle and O'Shea. Again, these things are also implemented in Macaulay2 amoung other places.

-
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 7, "mathjax_display_tex": 0, "mathjax_asciimath": 2, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "github"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "english_confidence": 0.9362534880638123, "perplexity_flag": "head"}