Related papers: Janet's Algorithm

Let $I$ be a square-free monomial ideal in a polynomial ring $R=K[x_1,\ldots, x_n]$ over a field $K$, $\mathfrak{m}=(x_1, \ldots, x_n)$ be the graded maximal ideal of $R$, and $\{u_1, \ldots, u_{\beta_1(I)}\}$ be a maximal independent set…

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…

Let $I\subset J$ be monomial ideals of a polynomial algebra $S$ over a field. Then the Stanley depth of $J/I$ is smaller or equal with the Stanley depth of $\sqrt{J}/\sqrt{I}$. We give also an upper bound for the Stanley depth of the…

We compute the Stanley depth for the quotient ring of a square free Veronese ideal and we give some bounds for the Stanley depth of a square free Veronese ideal. In particular, it follows that both satisfy the Stanley's conjecture.

Given a $d \times n$ integer matrix $A$, the main result is an elementary, simple-to-state algorithm that finds the largest $A$-graded ideal contained in any ideal $I$ in a polynomial ring $\Bbbk[x_1,\ldots,x_n]$. The special case where $A$…

We give several bounds for $sdepth_S(I+J)$, $sdepth_S(I\cap J)$, $sdepth_S(S/(I+J))$, $sdepth_S(S/(I\cap J))$, $sdepth_S(I:J)$ and $sdepth_S(S/(I:J))$ where $I,J\subset S=K[x_1,...,x_n]$ are monomial ideals. Also, we give several equivalent…

We study the Stanley depth and the Hilbert depth for $I$ and $S/I$, where $I\subset S=K[x_1,\ldots,x_N]$ is the intersection of monomial prime ideals with disjoint sets of variables. As an application, we obtain bounds for the Stanley depth…

Let $S = \mathbb{K}[x_1, \dots, x_n]$ be the polynomial ring over a field $\mathbb{K}$. In this paper we present a criterion for componentwise linearity of powers of monomial ideals. In particular, we prove that if a square-free monomial…

A monomial ideal $I$ admits a Betti splitting $I=J+K$ if the Betti numbers of $I$ can be determined in terms of the Betti numbers of the ideals $J,K$ and $J \cap K$. Given a monomial ideal $I$, we prove that $I=J+K$ is a Betti splitting of…

In this paper we show that the depth and the Stanley depth of the factor of two monomial ideals is invariant under taking a so called canonical form. It follows easily that the Stanley Conjecture holds for the factor if and only if it holds…

To a simplicial complex, we associate a square-free monomial ideal in the polynomial ring generated by its vertex set over a field. We study algebraic properties of this ideal via combinatorial properties of the simplicial complex. By…

Let $\mathbb{K}$ be a field and $S=\mathbb{K}[x_1,\dots,x_n]$ be the polynomial ring in $n$ variables over $\mathbb{K}$. Assume that $I\subset S$ is a squarefree monomial ideal. For every integer $k\geq 1$, we denote the $k$-th symbolic…

We compute the Stanley depth of irreducible monomial ideals and we show that the Stanley depth of a monomial complete intersection ideal is the same as the Stanley depth of it's radical. Also, we give some bounds for the Stanley depth of a…

Given an ideal $I$ in a polynomial ring $K[x_1,\dots,x_n]$ over a field $K$, we present a complete algorithm to compute the binomial part of $I$, i.e., the subideal ${\rm Bin}(I)$ of $I$ generated by all monomials and binomials in $I$. This…

We show that the Stanley's Conjecture holds for an intersection of four monomial prime ideals of a polynomial algebra $S$ over a field and for an arbitrary intersection of monomial prime ideals $(P_i)_{i\in [s]}$ of $S$ such that…

Let $J\subsetneq I$ be two ideals of a polynomial ring $S$ over a field, generated by square free monomials. We show that some inequalities among the numbers of square free monomials of $I\setminus J$ of different degrees give upper bounds…

In this paper, we are concerned with the problem of counting the multiplicities of a zero-dimensional regular set's zeros. We generalize the squarefree decomposition of univariate polynomials to the so-called pseudo squarefree decomposition…

When studying local properties of a polynomial ideal, one usually needs a theoretic technique called localization. For most cases, in spite of its importance, the computation in a localized ring cannot be algorithmically preformed. On the…

Given a zero-dimensional ideal I in a polynomial ring, many computations start by finding univariate polynomials in I. Searching for a univariate polynomial in I is a particular case of considering the minimal polynomial of an element in…

Let $S_n$ be a polynomial ring with $n$ variables over a field and $\{I_n\}_{n \geq 1}$ a chain of ideals such that each $I_n$ is a monomial ideal of $S_n$ fixed by permutations of the variables. In this paper, we present a way to determine…