Related papers: Janet's Algorithm

Triangular decomposition with different properties has been used for various types of problem solving, e.g. geometry theorem proving, real solution isolation of zero-dimensional polynomial systems, etc. In this paper, the concepts of strong…

We present a polynomial time algorithm, which solves a nonstandard Variation of the well-known PARTITION-problem: Given positive integers $n, k$ and $t$ such that $t \geq n$ and $k \cdot t = {n+1 \choose 2}$, the algorithm partitions the…

Let $Q$ and $Q'$ be two monomial primary ideals of a polynomial algebra $S$ over a field. We give an upper bound for the Stanley depth of $S/(Q\cap Q')$ which is reached if $Q$,$Q'$ are irreducible. Also we show that Stanley's Conjecture…

We study monomial ideals using the operation polarization to first turn them into square-free monomial ideals. We focus on monomial ideals whose polarization produce simplicial trees, and show that many of the properties of simplicial trees…

Fix a square-free monomial $m \in S = \mathbb{K}[x_1,\ldots,x_n]$. The square-free principal Borel ideal generated by $m$, denoted ${\rm sfBorel}(m)$, is the ideal generated by all the square-free monomials that can be obtained via Borel…

Let $I$ be a monomial ideal in a polynomial ring $S=K[x_1,\ldots,x_n]$ over a field $K$ with $n=2$ or $3$, and let $\overline{I}$ be its integral closure. We will show that $\text{reg} (\overline{I}) \le \text{reg} (I)$. Furthermore, if $I$…

Let $\Delta$ be an one-dimensional simplicial complex on $\{1,2,\ldots,s\}$ and $S$ the polynomial ring $K[x_1,\ldots,x_s]$ over a field $K$. The explicit formula for $a_0(S/I_{\Delta}^n)$ is presented when $\mathrm{girth}(\Delta)\geq 4$.…

In this paper, we describe how to get Janet decomposition for a finite set of terms and detect completeness of that set by means of the associated Bar Code. Moreover, we explain an algorithm to find a variable ordering (if it exists) s.t. a…

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…

In this paper we develop a new technique to compute the Betti table of a monomial ideal. We present a prototype implementation of the resulting algorithm and we perform numerical experiments suggesting a very promising efficiency. On the…

In this paper we present a procedure for computing the rational sum of the Hilbert series of a finitely generated monomial right module $N$ over the free associative algebra $K\langle x_1,\ldots,x_n \rangle$. We show that such procedure…

Given a homogeneous ideal I of a polynomial ring A=K[X_1,...,X_n] and a monomial order, we construct a new monomial ideal of A associated with I. We call it the zero-generic initial ideal of I with respect to the order and denote it with…

An explicit construction is given of a minimal free resolution of the ideal generated by all squarefree monomials of a given degree. The construction relies upon and exhibits the natural action of the symmetric group on the syzygy modules.…

Consider the ring $\mathcal{S}$ of symmetric polynomials in $k$ variables over an arbitrary base ring $\mathbf{k}$. Fix $k$ scalars $a_{1},a_{2},\ldots,a_{k}\in\mathbf{k}$. Let $I$ be the ideal of $\mathcal{S}$ generated by…

We present two new algorithms for the computation of the q-integer linear decomposition of a multivariate polynomial. Such a decomposition is essential for the treatment of q-hypergeometric symbolic summation via creative telescoping and…

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}$. In 1982, R. Stanley associated a combinatorial invariant to any finitely generated $\mathbb{Z}^n$-graded $S$-module…

Let G be a simple complex algebraic group and let K be a reductive subgroup of G such that the coordinate ring of G/K is a multiplicity free G-module. We consider the G-algebra structure of C[G/K], and study the decomposition into…

We present an alternative method for computing primary decomposition of zero-dimensional ideals over finite fields. Based upon the further decomposition of the invariant subspace of the Frobenius map acting on the quotient algebra in the…

Let $K$ be a field of characteristic zero, let $I \subset S = K[x_1,\dots,x_n]$ be a homogeneous ideal, and let $\partial(I)$ be its gradient ideal. We study the relationship between $\mathrm{reg}\,I$ and $\mathrm{reg}\,\partial(I)$. While…

We study the defining equations of the Rees algebra of square-free monomial ideals in a polynomial ring over a field. We determine that when an ideal $I$ is generated by $n$ square-free monomials of the same degree then $I$ has relation…