Efficient localization at a prime ideal without producing unnecessary primary components

DOI10.1007/s11786-022-00537-4OpenAlexW4293093387WikidataQ114221730 ScholiaQ114221730MaRDI QIDQ2103539

Yuki Ishihara

Publication date: 14 December 2022

Published in: Mathematics in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11786-022-00537-4

zbMATH Keywords

Gröbner basislocalizationprimary decompositiondouble ideal quotientthe degree of nilpotency

Mathematics Subject Classification ID

Symbolic computation and algebraic computation (68W30) Computational aspects and applications of commutative rings (13Pxx)

Uses Software

• SINGULAR
• primdecSYCI.lib
• syci.m2

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Localization and primary decomposition of polynomial ideals
• Algorithms for computing a primary ideal decomposition without producing intermediate redundant components
• Gröbner bases and primary decomposition of polynomial ideals
• Direct methods for primary decomposition
• Effective localization using double ideal quotient and its implementation
• The complexity of the word problems for commutative semigroups and polynomial ideals
• A Singular Introduction to Commutative Algebra
• Ideals, Varieties, and Algorithms
• Computational methods of commutative algebra and algebraic geometry. With chapters by David Eisenbud, Daniel R. Grayson, Jürgen Herzog and Michael Stillman

This page was built for publication: Efficient localization at a prime ideal without producing unnecessary primary components