相关论文: On the monomial reduction number of a monomial ide…

Let $I$ be a monomial ideal in a polynomial ring $A=K[x_1,...,x_n]$. We call a monomial ideal $J$ to be a minimal monomial reduction ideal of $I$ if there exists no proper monomial ideal $L \subset J$ such that $L$ is a reduction ideal of…

We discuss the problem of determining reduction number of a polynomial ideal I in n variables. We present two algorithms based on parametric computations. The first one determines the absolute reduction number of I and requires computation…

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…

We study when Taylor resolutions of monomial ideals are minimal. We consider monomial ideals with linear quotients. In particular, we determine precisely the stable ideals and the monomial ideals with linear resolutions having the miminal…

Let $S=\mathbb{K}[x_1,\ldots,x_n]$ the polynomial ring over a field $\mathbb{K}$. In this paper for some families of monomial ideals $I \subset S$ we study the minimal number of generators of $I^k$. We use this results to find some other…

This paper investigates atomic factorizations in the monoid $\mathcal I(R)$ of nonzero ideals of a multivariate polynomial ring $R$, under ideal multiplication. Building on recent advances in factorization theory for unit-cancellative…

For all natural numbers $N$ and prime numbers $p$, we find a knot $K$ whose skein polynomial $P_K(a,z)$ evaluated at $z=N$ has trivial reduction modulo $p$. An interesting consequence of our construction is that all polynomials $P_K(a,N)$…

Let A be a commutative ring and I an ideal of A with a reduction Q. In this paper we give an upper bound on the reduction number of I with respect to Q, when a suitable family of ideals in A is given. As a corollary it follows that if some…

Irreducible decompositions of monomial ideals in polynomial rings over a field are well-understood. In this paper, we investigate decompositions in the set of monomial ideals in the semigroup ring A[\mathbb{R}_{\geq 0}^d] where A is an…

This paper concerns the exponentiation of monomial ideals. While it is customary for the exponentiation operation on ideals to consider natural powers, we extend this notion to powers where the exponent is a positive real number. Real…

Given the monomial ideal I=(x_1^{{\alpha}_1},...,x_{n}^{{\alpha}_{n}})\subset K[x_1,...,x_{n}] where {\alpha}_{i} are positive integers and K a field and let J be the integral closure of I . It is a challenging problem to translate the…

We determine a new technique which allows the computation of the arithmetical rank of certain monomial ideals.

We present an algorithm which for any given ideal $I\subseteq\mathbb{K} [x,y]$ finds all elements of $I$ that have the form $f(x) - g(y)$, i.e., all elements in which no monomial is a multiple of $xy$.

In this note we calculate the multiplier ideal associated to an arbitrary monomial ideal in C^n. We discuss applications to the calculation of log canonical thresholds.

If $I$ is a monomial ideal with linear quotients, then it has componentwise linear quotients. However, the converse of this statement is an open question. In this paper, we provide two classes of ideals for which the converse of this…

The main focus of this paper is on the problem of relating an ideal $I$ in the polynomial ring $\mathbb Q[x_1, \dots, x_n]$ to a corresponding ideal in $\mathbb F_p[x_1,\dots, x_n]$ where $p$ is a prime number; in other words, the…

Let $\mathbb{K}$ be a field and $S=\mathbb{K}[x_1,...,x_n]$ be the polynomial ring in $n$ variables over the field $\mathbb{K}$. For every monomial ideal $I\subset S$, We provide a recursive formula to determine a lower bound for the…

Among other results, we prove that if $I$ is a monomial ideal of $S=K[x_1,\ldots,x_n]$, where $K$ is a field, and $a\geq b-1\geq0$ are integers such that $a+b\leq\mathrm{proj~dim}(S/I)$, then $$t_{a+b}\leq…

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…

In our earlier article~\cite{CanSakran} we initiated a study of the complement-finite submonoids of the group of integer points of a unipotent linear algebraic group. In the present article, we continue to develop tools and techniques for…