Comprehensive Systems for Primary Decompositions of Parametric Ideals

TL;DR

This paper introduces an effective method for computing parametric primary decompositions of ideals in polynomial rings with parameters, using comprehensive Gröbner systems and a new notion of feasibility to handle stability of ideal structures.

Contribution

It presents a novel algorithm for parametric primary decomposition that accounts for structural stability and introduces the concept of feasibility, improving computational effectiveness.

Findings

Successfully computes parametric primary decompositions in examples.

Provides a new algorithm that handles stability of ideal structures.

Demonstrates effectiveness through computational experiments.

Abstract

We present an effective method for computing parametric primary decomposition via comprehensive Gr\"obner systems. In general, it is very difficult to compute a parametric primary decomposition of a given ideal in the polynomial ring with rational coefficients $\mathbb{Q}[A,X]$ where $A$ is the set of parameters and $X$ is the set of ordinary variables. One cause of the difficulty is related to the irreducibility of the specialized polynomial. Thus, we introduce a new notion of ``feasibility'' on the stability of the structure of the ideal in terms of its primary decomposition, and we give a new algorithm for computing a so-called comprehensive system consisting of pairs $(C, \mathcal{Q})$, where for each parameter value in $C$, the ideal has the stable decomposition $\mathcal{Q}$. We may call this comprehensive system a parametric primary decomposition of the ideal. Also, one can also compute a dense set $\mathcal{O}$ such that $\varphi_\alpha(\mathcal{Q})$ is a primary decomposition for any $\alpha\in C\cap \mathcal{O}$ via irreducible polynomials. In addition, we give several computational examples to examine the effectiveness of our new decomposition.