Efficient computation of algebraic local cohomology classes and change of ordering for zero-dimensional standard bases

4Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

A new effective algorithm for computing a set of algebraic local cohomology classes is presented. The key ingredient of the proposed algorithm is to utilize a standard basis. As the application, an algorithm is given for the conversion of a standard basis of a zero-dimensional ideal with respect to any given local ordering into a standard basis with respect to any other local ordering, in the formal power series ring. The new algorithm always outputs a reduced standard basis.

Cite

CITATION STYLE

APA

Nabeshima, K., & Tajima, S. (2015). Efficient computation of algebraic local cohomology classes and change of ordering for zero-dimensional standard bases. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 9301, pp. 334–348). Springer Verlag. https://doi.org/10.1007/978-3-319-24021-3_25

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free