Efficient localization at a prime ideal without producing unnecessary primary components

DOI10.1007/S11786-022-00537-4MaRDI QIDQ2103539zbMATH OpenOpenAlexWikidataFDO

Authors 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

[https://portal.mardi4nfdi.de/w/index.php?title=+Special%3ASearch&search=Gr%EF%BF%BD%EF%BF%BDbner+basis&go=Go Gr��bner basis]localizationprimary decompositiondouble ideal quotientthe degree of nilpotency

Mathematics Subject Classification ID

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

Recommendations

• Effective localization using double ideal quotient and its implementation
• Mora's holy graal: algorithms for computing in localizations at prime ideals
• Localization and primary decomposition of polynomial ideals
• Algorithm for primary submodule decomposition without producing intermediate redundant components
• Direct methods for primary decomposition

Cites work

• scientific article; zbMATH DE number 5990116 (Why is no real title available?)
• scientific article; zbMATH DE number 1302473 (Why is no real title available?)
• scientific article; zbMATH DE number 217454 (Why is no real title available?)
• scientific article; zbMATH DE number 1827070 (Why is no real title available?)
• A Singular Introduction to Commutative Algebra
• Algorithms for computing a primary ideal decomposition without producing intermediate redundant components
• Computational methods of commutative algebra and algebraic geometry. With chapters by David Eisenbud, Daniel R. Grayson, Jürgen Herzog and Michael Stillman
• Direct methods for primary decomposition
• Effective localization using double ideal quotient and its implementation
• Gröbner bases and primary decomposition of polynomial ideals
• Ideals, Varieties, and Algorithms
• Localization and primary decomposition of polynomial ideals
• The complexity of the word problems for commutative semigroups and polynomial ideals

Describes a project that uses

Uses Software

• SINGULAR
• primdecSYCI.lib
• syci.m2

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2103539)