Effective localization using double ideal quotient and its implementation

DOI10.1007/978-3-319-99639-4_19MaRDI QIDQ1798329zbMATH OpenOpenAlexFDO

Authors Yuki Ishihara, Kazuhiro Yokoyama

Publication date 23 October 2018

Full work available at URL https://arxiv.org/abs/2003.00220

zbMATH Keywords

Gröbner basislocalizationprimary decomposition

Mathematics Subject Classification ID

Ideals and multiplicative ideal theory in commutative rings (13A15) Gröbner bases; other bases for ideals and modules (e.g., Janet and border bases) (13P10)

Abstract: In this paper, we propose a new method for localization of polynomial ideal, which we call "Local Primary Algorithm". For an ideal $I$ and a prime ideal $P$, our method computes a $P$-primary component of $I$ after checking if $P$ is associated with $I$ by using "double ideal quotient" $(I:(I:P))$ and its variants which give us a lot of information about localization of $I$.

Recommendations

• Localization and primary decomposition of polynomial ideals
• New algorithms for computing primary decomposition of polynomial ideals
• Direct methods for primary decomposition
• Mora's holy graal: algorithms for computing in localizations at prime ideals
• A new approach to primary decomposition

Cited in

(6)

• Efficient localization at a prime ideal without producing unnecessary primary components
• Constructive arithmetics in Ore localizations enjoying enough commutativity
• scientific article; zbMATH DE number 4190429 (Why is no real title available?)
• Mora's holy graal: algorithms for computing in localizations at prime ideals
• Modular techniques for effective localization and double ideal quotient
• A signature-based algorithm for computing the nondegenerate locus of a polynomial system

Describes a project that uses

Uses Software

• Risa/Asir
• SINGULAR

This page was built for publication: Effective localization using double ideal quotient and its implementation

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