Related papers: On the arithmetic of polynomial ideals

Classically, Groebner bases are computed by first prescribing a set monomial order. Moss Sweedler suggested an alternative and developed a framework to perform such computations by using valuation rings in place of monomial orders. We build…

An ideal of a local polynomial ring can be described by calculating a standard basis with respect to a local monomial ordering. However standard basis algorithms are not numerically stable. Instead we can describe the ideal numerically by…

We propose a numerical linear algebra based method to find the multiplication operators of the quotient ring $\mathbb{C}[x]/I$ associated to a zero-dimensional ideal $I$ generated by $n$ $\mathbb{C}$-polynomials in $n$ variables. We assume…

In this paper we consider monomial localizations of monomial ideals and conjecture that a monomial ideal is polymatroidal if and only if all its monomial localizations have a linear resolution. The conjecture is proved for squarefree…

This paper considers graded near-rings over a monoid G as a generalizations of the graded rings over groups, introduce certain innovative graded weakly prime ideals and graded almost prime ideals as a generalizations of graded prime ideals…

In this paper we obtain some statements concerning ideals of polynomials and apply these results in a number of different situations. Among other results, we present new characterizations of $\mathcal{L}_{\infty}$-spaces, Coincidence…

We study the set of algebraic objects known as vanishing polynomials (the set of polynomials that annihilate all elements of a ring) over general commutative rings with identity. These objects are of special interest due to their close…

The article investigates the properties of associative ideals in monoids. Such ideals have some applications in the logic of non-standard sequences and category theory. The relations of these ideals with the verbal structure of words over…

Let $\mathbb{F}[X]$ be the polynomial ring over the variables $X=\{x_1,x_2, \ldots, x_n\}$. An ideal $I=\langle p_1(x_1), \ldots, p_n(x_n)\rangle$ generated by univariate polynomials $\{p_i(x_i)\}_{i=1}^n$ is a \emph{univariate ideal}. We…

For an ideal $I$ in a polynomial ring over a field, a monomial support of $I$ is the set of monomials that appear as terms in a set of minimal generators of $I$. Craig Huneke asked whether the size of a monomial support is a bound for the…

Let $R = k[x_1, \dotsc , x_n]$ denote the standard graded polynomial ring over a field $k$. We study certain classes of equigenerated monomial ideals with the property that the so-called complementary ideal has no linear relations on the…

Using linear algebra methods we study certain algebraic properties of monomial rings and matroids. Let I be a monomial ideal in a polynomial ring over an arbitrary field. If the Rees cone of I is quasi-ideal, we express the normalization of…

This paper continues a research program on constructive investigations of non-commutative Ore localizations, initiated in our previous papers, and particularly touches the constructiveness of arithmetics within such localizations. Earlier…

A new efficient algorithm is proposed for factoring polynomials over an algebraic extension field. The extension field is defined by a polynomial ring modulo a maximal ideal. If the maximal ideal is given by its Groebner basis, no extra…

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 provide an algorithm that computes a set of generators for any complete ideal in a smooth complex surface. More interestingly, these generators admit a presentation as monomials in a set of maximal contact elements associated to the…

We investigate the structure of power-closed ideals of the complex polynomial ring $R = \mathbb{C}[x_1,\ldots,x_d]$ and the Laurent polynomial ring $R^{\pm} = \mathbb{C}[x_1,\ldots,x_d]^{\pm} = M^{-1}\mathbb{C}[x_1,\ldots,x_d]$, where $M$…

Let $I \subseteq R = \mathbb{K}[x_1,\ldots,x_n]$ be a toric ideal, i.e., a binomial prime ideal. We investigate when the ideal $I$ can be "split" into the sum of two smaller toric ideals. For a general toric ideal $I$, we give a sufficient…

For a finite subset $M\subset [x_1,\ldots,x_d]$ of monomials, we describe how to constructively obtain a monomial ideal $I\subseteq R = K[x_1,\ldots,x_d]$ such that the set of monomials in $\text{Soc}(I)\setminus I$ is precisely $M$, or…

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.