Related papers: The Gr\"obner basis for powers of a general linear…
It is well known that for a subscheme $V$ in ${\mathbb P}^{n}$ of codimension two, the conditions (1) $V$ is ACM, and (2) $V$ is "licci" (i.e. $V$ is in the liaison class of a complete intersection) are equivalent. In higher codimension,…
Consider ideals $I$ of the form \[ I=(x_1^2,\dots, x_n^2)+\mathrm{RLex}(x_ix_j) \] where $\mathrm{RLex}(x_ix_j)$ is the ideal generated by all the square-free monomials which are greater than or equal to $x_ix_j$ in the reverse…
Nearly complete intersection ideals were introduced by A. Boocher and J. Seiner (2018) and defines a special class of monomial ideals in a polynomial ring. These ideals were used to give a lower bound of the total sum of betti numbers that…
The aim of this survey is to explore complete intersection monomial curves from a contemporary perspective. The main goal is to help readers understand the intricate connections within the field and its potential applications. The…
A major open question in the theory of Gorenstein liaison is whether or not every arithmetically Cohen--Macaulay subscheme of $\mathbb{P}^n$ can be G-linked to a complete intersection. Migliore and Nagel showed that, if such a scheme is…
We study a class of combinatorially-defined polynomial ideals which are generated by minors of a generic symmetric matrix. Included within this class are the symmetric determinantal ideals, the symmetric ladder determinantal ideals, and the…
This extended abstract gives a construction for lifting a Gr\"obner basis algorithm for an ideal in a polynomial ring over a commutative ring R under the condition that R also admits a Gr\"obner basis for every ideal in R.
A restricted $d$th power of an ideal $I$ is obtained by restricting the exponent vectors allowed to appear on the "natural" generating set of $I^d$, for some integer $d$. In this paper, we study homological properties of restricted powers…
A \textit{symmetric ideal} $I \subseteq R = K[x_1,x_2,...]$ is an ideal that is invariant under the natural action of the infinite symmetric group. We give an explicit algorithm to find Gr\"obner bases for symmetric ideals in the infinite…
In [GTZ08, GTZ12], the following result was established: given polynomials $f,g\in\mathbb{C}[x]$ of degrees larger than $1$, if there exist $\alpha,\beta\in\mathbb{C}$ such that their corresponding orbits $\mathcal{O}_f(\alpha)$ and…
We give a characterization of the Lefschetz elements in Artinian Gorenstein rings over a field of characteristic zero in terms of the higher Hessians. As an application, we give new examples of Artinian Gorenstein rings which do not have…
For the ideal $I = \langle y_1 + \dots + y_n, y^2_1, \dots , y^2_n \rangle$ in $R = {\mathbb F}[y_1, \dots , y_n]$ with char($\mathbb F$) = 0, we show that the reduced Gr\"obner basis with lex-order consists of polynomials $g_\alpha$ that…
Much progress has been made in classifying when the weak Lefschetz property holds for $A=\mathbb{F}[x,y,z]/I$ where $\text{char}(\mathbb{F})=0$ and $I=(x_{1}^{d_{1}},y^{d_{2}},z^{d_{3}},x^{a_{1}}y^{a_{2}}z^{a_{3}})$ is a monomial almost…
We study properties of the resolution of almost Gorenstein artinian algebras $R/I,$ i.e. algebras defined by ideals $I$ such that $I=J+(f),$ with $J$ Gorenstein ideal and $f\in R.$ Such algebras generalize the well known almost complete…
Let $S=K[x_1,\dots,x_n]$ be the polynomial ring over a field $K$ and $I\subset S$ be a squarefree monomial ideal generated in degree $n-2$. Motivated by the remarkable behavior of the powers of $I$ when $I$ admits a linear resolution, as…
Let $R=K[x_1,\ldots, x_n]$ be the polynomial ring in $n$ variables over a field $K$ and let $I$ be a monomial ideal of $R$. In this paper, we present an explicit formula for the Betti numbers of almost complete intersection monomial ideals,…
We describe the universal Groebner basis of the ideal of maximal minors and the ideal of $2$-minors of a multigraded matrix of linear forms. Our results imply that the ideals are radical and provide bounds on the regularity. In particular,…
Two correspondences have been provided that associate any linear code over a finite field with a binomial ideal. In this paper, algorithms for computing their Graver bases and universal Gr\"obner bases are given. To this end, a connection…
We present an efficient algorithm for computing the leading monomials of a minimal Groebner basis of a generic sequence of homogeneous polynomials. Our approach bypasses costly polynomial reductions by exploiting structural properties…
We determine a sharp lower bound for the Hilbert function in degree $d$ of a monomial algebra failing the weak Lefschetz property over a polynomial ring with $n$ variables and generated in degree $d$, for any $d\geq 2$ and $n\geq 3$. We…