Related papers: A test for monomial containment

Scattered over the past few years have been several occurrences of simplicial complexes whose topological behavior characterize the Cohen-Macaulay property for quotients of polynomial rings by arbitrary (not necessarily squarefree) monomial…

In this paper we study monomial ideals attached to posets, introduce generalized Hibi rings and investigate their algebraic and homological properties. The main tools to study these objects are Groebner basis theory, the concept of…

Although Buchberger's algorithm, in theory, allows us to compute Gr\"obner bases over any field, in practice, however, the computational efficiency depends on the arithmetic of the ground field. Consider a field $K = \mathbb{Q}(\alpha)$, a…

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…

For an efficient implementation of Buchberger's Algorithm, it is essential to avoid the treatment of as many unnecessary critical pairs or obstructions as possible. In the case of the commutative polynomial ring, this is achieved by the…

We construct a Gr\"obner Basis of the relation ideal of a polynomial, give an interpolation formula for the basis elements and explain the connection of the interpolation formula to the Buchberger--M\"oller algorithm. We present a situation…

We will study monomial ideals $I$ in the exterior algebra as well as in the polynomial ring whose generic initial ideal is constant for all term orders up to permutations of variables. First, in the exterior algebra, we determine all graphs…

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…

We present a randomized polynomial-time algorithm to generate a random integer according to the distribution of norms of ideals at most N in any given number field, along with the factorization of the integer. Using this algorithm, we can…

We give an especially simple proof of a theorem in graph theory that forms the key part of the solution to a problem in commutative algebra, on how to characterize the integral closure of a polynomial ring generated by quadratic monomials.

We find an explicit expression of the associated primes of monomial ideals as a colon by an element $v$, using the unique irredundant irreducible decomposition whose irreducible components are monomial ideals (Theorem 3.1). An algorithm to…

This short paper presents saturation-based algorithms for homogenization and elimination. This algorithm can compute elimination ideals by using syzygies and ideal membership test, hence it works with any} monomial order, in particular…

Given an ideal I in a polynomial ring, we consider the largest monomial subideal contained in I, denoted mono(I). We study mono as an interesting operation in its own right, guided by questions that arise from comparing the Betti tables of…

We investigate different approaches to transform a given binomial into a monomial via blowing up appropriate centers. In particular, we develop explicit implementations in {\sc Singular}, which allow to make a comparison on the basis of…

We characterize monomial ideals which are intersections of monomial prime ideals and study classes of ideals with this property, among them polymatroidal ideals.

In this article we first compare the set of elements in the socle of an ideal of a polynomial algebra $K[x_1,\ldots,x_d]$ over a field $K$ that are not in the ideal itself and Macaulay's inverse systems of such polynomial algebras in a…

Using polynomial evaluation, we give some useful criteria to answer questions about divisibility of polynomials. This allows us to develop interesting results concerning the prime elements in the domain of coefficients. In particular, it is…

Let $R=K[x_1,\ldots, x_n]$ be the polynomial ring in $n$ variables over a field $K$ and let $M_{n,t}=(x^{e_1},\ldots, x^{e_n})$ be a monomial ideal of $R$, where $x^{e_i}=x_1^t\ldots x_{i-1}^tx_{i+1}^t\ldots x_n^t$. We study the unmixedness…

We show that the regularity of monomial ideals whose associated prime ideals are totally ordered by inclusion is linearly bounded.

Let $I$ be a monomial ideal of a polynomial ring $R$. In this paper we determine a number $B$ such that $\Ass (I^n/I^{n+1}) = \Ass (I^{B}/I^{B+1})$ for all $n\geq B$.