Related papers: Computing real powers of monomial ideals
It is shown that any set of nonzero monomial prime ideals can be realized as the stable set of associated prime ideals of a monomial ideal. Moreover, an algorithm is given to compute the stable set of associated prime ideals of a monomial…
We call a set of positive integers closed under taking unitary divisors a unitary ideal. It can be regarded as a simplicial complex. Moreover, a multiplicative arithmetical function on such a set corresponds to a function on the simplicial…
We consider the theory of algebraically closed fields of characteristic zero with multivalued operations $x\mapsto x^r$ (raising to powers). It is in fact the theory of equations in exponential sums. In an earlier paper we have described…
There are two different notions for symbolic powers of ideals existing in the literature, one defined in terms of associated primes, the other in terms of minimal primes. Elaborating on an idea known to Eisenbud, Herzog, Hibi, and Trung, we…
Let $I\subset A$ and $J\subset B$ be two monomial ideals, where $A$ and $B$ are two polynomial rings with disjoint variables. Considering a general set-up of monomial filtrations, we study the behaviour of the $\mathrm{v}$-function under…
Algebraic and combinatorial properties of a monomial ideal and its radical are compared.
We construct monomial ideals with the property that their depth function has any given number of strict local maxima.
Starting from \cite{Ayy2} we compute the Groebner basis for the defining ideal, P, of the monomial curves that correspond to arithmetic sequences, and then give an elegant description of the generators of powers of the initial ideal of P,…
The aims of this work are to study Rees algebras of filtrations of monomial ideals associated to covering polyhedra of rational matrices with non-negative entries and non-zero columns using combinatorial optimization and integer…
Recent work of Ein-Lazarsfeld-Smith and Hochster-Huneke raised the problem of which symbolic powers of an ideal are contained in a given ordinary power of the ideal. Bocci-Harbourne developed methods to address this problem, which involve…
We prove that a monomial ideal $I$ generated in a single degree, is polymatroidal if and only if it has linear quotients with respect to the lexicographical ordering of the minimal generators induced by every ordering of variables. We also…
Symbolic powers are studied in the combinatorial context of monomial ideals. When the ideals are generated by quadratic squarefree monomials, the generators of the symbolic powers are obstructions to vertex covering in the associated graph…
The Taylor resolution is almost never minimal for powers of monomial ideals, even in the square-free case. In this paper we introduce a smaller resolution for each power of any square-free monomial ideal, which depends only on the number of…
Given a polynomial ring $C$ over a field and proper ideals $I$ and $J$ whose generating sets involve disjoint variables, we determine how to embed the associated primes of each power of $I+J$ into a collection of primes described in terms…
We extend the shell and kernel reductions for hyperexponential functions over the field of rational functions to a monomial extension. Both of the reductions are incorporated into one algorithm. As an application, we present an additive…
We associate to each $r$-multigraded, locally finitely generated ideal in the "large polynomial ring" on countably many indeterminates a power series in $r$ variables; this power series is the limit in the adic topology of the numerators of…
We show that the real parts of the poles of the Igusa zeta function of a monomial ideal can be computed from the torus-invariant divisors on the normalized blowing-up along the ideal. Moreover, we show that every such number is a root of…
We propose a general method for optimization with semi-infinite constraints that involve a linear combination of functions, focusing on the case of the exponential function. Each function is lower and upper bounded on sub-intervals by…
We study existence and computability of finite bases for ideals of polynomials over infinitely many variables. In our setting, variables come from a countable logical structure A, and embeddings from A to A act on polynomials by renaming…
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$…