Related papers: A criterion for a monomial ideal to have a linear …
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.
In this paper, we prove that every binomial ideal in a polynomial ring over an algebraically closed field of characteristic zero admits a canonical primary decomposition into binomial ideals. Moreover, we prove that this special…
Given an endomorphism u of a finite-dimensional vector space over an arbitrary field K, we give necessary and sufficient conditions for the existence of a regular quadratic form (resp. a symplectic form) for which u is orthogonal (resp.…
We use initially regular sequences that consist of linear sums to explore the depth of $R/I^2$, when $I$ is a monomial ideal in a polynomial ring $R$. We give conditions under which these linear sums form regular or initially regular…
We consider the entire characteristic functions of order 2 and we prove some decomposition theorems in a multidimensional case. We show that the lack of zeros of the density function is a necessary but not a sufficient (as in the…
Minimal free resolutions of graded modules over a noetherian polynomial ring have been attractive objects of interest for more than a hundred years. We introduce and study two natural extensions in the setting of graded modules over a…
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…
Let $F$ be an algebraically closed field of characteristic $p$. We fashion an infinite dimensional basic algebra $\underleftarrow{\mathcal{C}}_p(F)$, with a transparent combinatorial structure, which we expect to control the rational…
We associate to every graph a linear program for packings of vertex disjoint paths. We show that the optimal primal and dual values of the corresponding integer program are the binomial grade and height of the binomial edge ideal of the…
One can iteratively obtain a free resolution of any monomial ideal $I$ by considering the mapping cone of the map of complexes associated to adding one generator at a time. Herzog and Takayama have shown that this procedure yields a minimal…
The article proved the upper bound of leading coefficient of characteristic polynomial of graded ideal in a ring of generalized polynomials.
An ideal $I$ of a commutative ring $R$ is said to be of linear type when its Rees algebra and symmetric algebra exhibit isomorphism. In this paper, we investigate the conjecture put forth by Jayanthan, Kumar, and Sarkar (2021) that if $G$…
We survey results produced from the interaction between methods in prime characteristic and combinatorial commutative algebra. We showcase results for edge ideals, toric varieties, Stanley-Reisner rings, and initial ideals that were proven…
Let $(R, \frak m)$ be a Noetherian local ring, $M$ a finitely generated $R$-module. The aim of this paper is to prove a uniform formula for the index of reducibility of paprameter ideals of $M$ provided the polynomial type of $M$ is at most…
We provide a new combinatorial approach to study the minimal free resolutions of edge ideals, that is, quadratic square-free monomial ideals. With this method we can recover most of the known results on resolutions of edge ideals with…
We will explore some properties of minimal graded free resolutions of $R/I$, where $R$ is a trivariate polynomial ring over a field and $I$ is a monomial ideal. Our focus will be to consider a specific form of the resolutions when $I$ is…
Let $S=K[x_1,\ldots,x_n]$ be the polynomial ring over a field and $A$ a standard graded $S$-algebra. In terms of the Gr\"obner basis of the defining ideal $J$ of $A$ we give a condition, called the x-condition, which implies that all graded…
In this paper, we propose a uniform approach to tackle problems about squarefree monomial ideals whose powers have good properties. We employ this approach to achieve a twofold goal: (i) recover and extend several well--known results in the…
We present a procedure for computing the log-canonical threshold of an arbitrary ideal generated by binomials and monomials. The computation of the log canonical threshold is reduced to the problem of computing the minimum of a function,…
The problem of determining the representation type of the full transformation monoid was resolved by Ponizovskii, Putcha, and Ringel. In this paper, we present a similar result for the monoid of binary relations, a partial result for the…