Related papers: Computing generalized Frobenius powers of monomial…

We establish characteristic-free criteria for the componentwise linearity of graded ideals. As applications, we classify the componentwise linear ideals among the Gorenstein ideals, the standard determinantal ideals, and the ideals…

We construct an explicit minimal strong Groebner basis of the ideal of vanishing polynomials in the polynomial ring over Z/m for m>=2. The proof is done in a purely combinatorial way. It is a remarkable fact that the constructed Groebner…

The paper presents two algorithms for finding irreducible decomposition of monomial ideals. The first one is recursive, derived from staircase structures of monomial ideals. This algorithm has a good performance for highly non-generic…

In this paper we study the Frobenius characters of the invariant subspaces of the tensor powers of a representation V. The main result is a formula for these characters for a polynomial functor of V involving the characters for V. The main…

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…

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…

We provide suitable conditions under which the asymptotic limit of the Hilbert-Samuel coefficients of the Frobenius powers of an $\mathfrak{m}$-primary ideal exists in a Noetherian local ring $(R,\mathfrak{m})$ with prime characteristic…

We interpret the symmetrized weight enumerator of linear codes over finite commutative Frobenius rings as a summation over multisets and thereby provide a new proof of the MacWilliams identity for the symmetrized weight enumerator. The…

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.

We realize Frobenius conjugacy classes in Galois groups of certain $q$-polynomials over $\mathbb{F}_q(t)$ using specific degree 1 ideals. We combine this with methods from elementary linear algebra and group theory to realize transvections…

We give a new, elementary proof of the celebrated Herzog-Hibi-Zheng theorem on powers of quadratic monomial ideals.

We present a close relationship between matching number, covering numbers and their fractional versions in combinatorial optimization and ordinary powers, integral closures of powers, and symbolic powers of monomial ideals. This…

We consider ideals arising in the context of conditional independence models that generalize the class of ideals considered by Fink [7] in a way distinct from the generalizations of Herzog-Hibi-Hreinsdottir-Kahle-Rauh [13] and Ay-Rauh [1].…

We prove that the standard conjecture of Hodge type holds for powers of abelian threefolds. Along the way, we also prove the conjecture for powers of simple abelian variety of prime dimension over finite fields, and in other related cases…

We study the normalization of a monomial ideal, and show how to compute its Hilbert function (using Ehrhart polynomials) if the ideal is zero dimensional. A positive lower bound for the second coefficient of the Hilbert polynomial is shown.

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…

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.

We introduce the combinatorial Lyubeznik resolution of monomial ideals. We prove that this resolution is isomorphic to the usual Lyubezbnik resolution. As an application, we give a combinatorial method to determine if an ideal is a…

The purpose of this work is to generalize part of the theory behind Faugere's "F5" algorithm. This is one of the fastest known algorithms to compute a Groebner basis of a polynomial ideal I generated by polynomials f_{1},...,f_{m}. A major…

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…