Efficient localization at a prime ideal without producing unnecessary primary components
DOI10.1007/S11786-022-00537-4OpenAlexW4293093387WikidataQ114221730 ScholiaQ114221730MaRDI QIDQ2103539FDOQ2103539
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
[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
Symbolic computation and algebraic computation (68W30) Computational aspects and applications of commutative rings (13Pxx)
Cites Work
- A Singular Introduction to Commutative Algebra
- Algorithms for computing a primary ideal decomposition without producing intermediate redundant components
- Ideals, Varieties, and Algorithms
- Direct methods for primary decomposition
- Title not available (Why is that?)
- Gröbner bases and primary decomposition of polynomial ideals
- Title not available (Why is that?)
- The complexity of the word problems for commutative semigroups and polynomial ideals
- Localization and primary decomposition of polynomial ideals
- Title not available (Why is that?)
- Computational methods of commutative algebra and algebraic geometry. With chapters by David Eisenbud, Daniel R. Grayson, Jürgen Herzog and Michael Stillman
- Effective localization using double ideal quotient and its implementation
- Title not available (Why is that?)
Uses Software
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)
