相关论文: Standard pairs of monomial ideals over non-normal …

We extend the notion of standard pairs to the context of monomial ideals in semigroup rings. Standard pairs can be used as a data structure to encode such monomial ideals, providing an alternative to generating sets that is well suited to…

We describe a new software package for computing multiplier ideals in certain cases, including monomial ideals, monomial curves, generic determinantal ideals, and hyperplane arrangements. In these cases we take advantage of combinatorial…

The {\tt Macaulay2} package {\tt RandomMonomialIdeals} provides users with a set of tools that allow for the systematic generation and study of random monomial ideals. It also introduces new objects, Sample and Model, to allow for…

We introduce the Macaulay2 package MatchingPowers. It allows to compute and manipulate the matching powers of a monomial ideal. The basic theory of matching powers is explained and the main features of the package are presented.

Considering finite extensions K[A] \subseteq K[B] of positive affine semigroup rings over a field K we have developed in [1] an algorithm to decompose K[B] as a direct sum of monomial ideals in K[A]. By computing the regularity of…

The package Binomials contains implementations of specialized algorithms for binomial ideals, including primary decomposition into binomial ideals. The current implementation works in characteristic zero. Primary decomposition is restricted…

We introduce the Macaulay2 package HomologicalShiftIdeals. It allows to compute the homological shift ideals of a monomial ideal, and to check the homological shift properties, including having linear resolution, having linear quotients, or…

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 introduce a detection algorithm for SAGBI basis in polynomial rings, analogous to a Gr\"obner basis detection algorithm previously proposed by Gritzmann and Sturmfels. We also present two accompanying software packages named…

An ideal of polynomials is symmetric if it is closed under permutations of variables. We relate general symmetric ideals to the so called Specht ideals generated by all Specht polynomials of a given shape. We show a connection between the…

The NumericalHilbert package for Macaulay2 includes algorithms for computing local dual spaces of polynomial ideals, and related local combinatorial data about its scheme structure. These techniques are numerically stable, and can be used…

We give a description of a new Macaulay2 package called SimplicialPosets. This package provides functions for working with simplicial posets and calculating their generalized Stanley-Reisner ideals. For practical purposes, we also introduce…

We introduce a Macaulay2 package for working with jet schemes. The main method constructs jets of ideals, polynomial rings and their quotients, ring homomorphisms, affine varieties, and (hyper)graphs. The package also includes additional…

Let $K$ be a field and $S=K[x_1,\ldots,x_n]$ a standard polynomial ring over $K$. In this paper, some new optimized algorithms to compute the smallest $t$-spread lexicographic set and the smallest $t$-spread strongly stable set containing a…

This paper extends the article of the Bruns and Conca on SAGBI bases and their computation (J. Symb. Comput. 120 (2024)) in two directions. (i) We describe the extension of the Singular library sagbiNormaliz.sing to the computation of…

In this paper we investigate the question of normality for special monomial ideals in a polynomial ring over a field. We first include some expository sections that give the basics on the integral closure of a ideal, the Rees algebra on an…

In this paper, we introduce techniques for producing normal square-free monomial ideals from old such ideals. These techniques are then used to investigate the normality of cover ideals under some graph operations. Square-free monomial…

This paper considers numerical semigroups $S$ that have a non-principal relative ideal $I$ such that $\mu_S(I)\mu_S(S-I)=\mu_S(I+(S-I)) $. We show the existence of an infinite family of such which $I+(S-I)=S\backslash\{0\}$. We also show…

For a polynomial ring S in n variables, we consider the natural action of the symmetric group S_n on S by permuting the variables. For an S_n-invariant monomial ideal I in S and j >= 0, we give an explicit recipe for computing the modules…

In this paper we study the normality of monomial ideals using linear programming and graph theory. We give normality criteria for monomial ideals, for ideals generated by monomials of degree two, and for edge ideals of graphs and clutters…