Related papers: Primary Decomposition with Differential Operators

An ideal in a polynomial ring encodes a system of linear partial differential equations with constant coefficients. Primary decomposition organizes the solutions to the PDE. This paper develops a novel structure theory for primary ideals in…

A primary ideal in a polynomial ring can be described by the variety it defines and a finite set of Noetherian operators, which are differential operators with polynomial coefficients. We implement both symbolic and numerical algorithms to…

Noetherian operators are differential operators that encode primary components of a polynomial ideal. We develop a framework, as well as algorithms, for computing Noetherian operators with local dual spaces, both symbolically and…

We establish the primary decomposition and uniqueness of primary decomposition for k-ideals in commutative Noetherian semirings.

We present an algorithm to compute the primary decomposition of a submodule $\mathcal{N}$ of the free module $\Z[x_1, \ldots, x_n]^m$. For this purpose we use algorithms for primary decomposition of ideals in the polynomial ring over the…

Recent results of Kahle and Miller give a method of constructing primary decompositions of binomial ideals by first constructing "mesoprimary decompositions" determined by their underlying monoid congruences. These mesoprimary…

We study primary submodules and primary decompositions from a differential and computational point of view. Our main theoretical contribution is a general structure theory and a representation theorem for primary submodules of an arbitrary…

We present an algorithm to compute a primary decomposition of an ideal in a polynomial ring over the integers. For this purpose we use algorithms for primary decomposition in polynomial rings over the rationals resp. over finite fields, and…

Generalizing the concept of the Macaulay inverse system, we introduce a way to describe localizations of an ideal in a polynomial ring. This leads to an approach to the differential primary decomposition as a description of the affine…

The package Binomials contains implementations of specialized algorithms for binomial ideals, including primary decomposition into binomial ideals. The current implementation works in characteristic zero. Primary decomposition is restricted…

We present Binomials, a package for the computer algebra system Macaulay2, which specializes well known algorithms to binomial ideals. These come up frequently in algebraic statistics and commutative algebra, and it is shown that…

Students studying the Lasker-Noether theorem on primary decomposition of ideals may want to see an example of an ideal (necessarily in a non-Noetherian ring) which does not have a primary decomposition. The most well-known counterexample is…

This paper has two aims. The first is to study ideals of minors of matrices whose entries are among the variables of a polynomial ring. Specifically, we describe matrices whose ideals of minors of a given size are prime. The main result in…

Consider an ideal $I \subset R = \bC[x_1,...,x_n]$ defining a complex affine variety $X \subset \bC^n$. We describe the components associated to $I$ by means of {\em numerical primary decomposition} (NPD). The method is based on the…

Let $R$ be a commutative ring with identity and $S \subseteq R$ be a multiplicative set. An ideal $Q$ of $R$ (disjoint from $S$) is said to be $S$-primary if there exists an $s\in S$ such that for all $x,y\in R$ with $xy\in Q$, we have…

In this paper, we present a modular strategy which describes key properties of the absolute primary decomposition of an equidimensional polynomial ideal defined by polynomials with rational coefficients. The algorithm we design is based on…

In this article, we study the primary decomposition of some binomial ideals. In particular, we introduce the concept of polyocollection, a combinatorial object that generalizes the definitions of collection of cells and polyomino, that can…

In this paper, we provide a complete description of the minimal primes of ideals generated by adjacent $2$-minors, in terms of the so-called admissible sets and associated lattice ideals. We prove that for these ideals, the properties of…

We propose an effective method for primary decomposition of symmetric ideals. Let $K[X]=K[x_1,\ldots,x_n]$ be the $n$-valuables polynomial ring over a field $K$ and $\mathfrak{S}_n$ the symmetric group of order $n$. We consider the…

In our recent work, we introduced a generalization of the prime ideal factorization in Dedekind domains for submodules of finitely generated modules over Noetherian rings. In this article, we find conditions for the intersection of two…