arXiv subjects
Publications and source records attributed to Marilena Crupi.
Let $S$ be a polynomial ring in $n$ variables over a field $K$ of characteristic $0$. A numerical characterization of all possible extremal Betti numbers of any graded submodule of a finitely generated graded free $S$-module is given.
Let $K$ be a field, $V$ a $K$-vector space with basis $e_1,\ldots,e_n$, and $E$ the exterior algebra of $V$. To a given monomial ideal $I\subsetneq E$ we associate a special monomial ideal $J$ with generators in the same degrees as those of $I$ and such that the number of the minimal monomial generators in each degree of $I$ and $J$ coincide. We call $J$ the colexsegment ideal associated to $I$. We prove that the class of strongly stable ideals in $E$ generated in one degree satisfies the colex lower bound, that is, the total Betti numbers of the colexsegment ideal associated to a strongly stable ideal $I\subsetneq E$ generated in one degree are smaller than or equal to those of $I$.
The class of closed graphs by a linear ordering on their sets of vertices is investigated. A recent characterization of such a class of graphs is analyzed by using tools from the proper interval graph theory.
Let K be a field and S a polynomial ring in a finite number of variables over K. Let F be a finitely generated graded free S-module. We examine some classes of squarefree monomial submodules of F. Hence, we focalize our attention on the Betti table of such classes in order to analyze the behavior of their extremal Betti numbers.
Let K be a field and let A be the polynomial ring in n variables with coefficients in the field K We study the universal squarefree lexsegment ideals in A. We put our attention on their combinatorics computing some invariants. Moreover we study the link between such special class of squarefree lexsegment ideals and the so called s-sequences.
In this note we prove that every closed graph $G$ is up to isomorphism a proper interval graph. As a consequence we obtain that there exist linear-time algorithms for closed graph recognition.
Let $G$ be a simple graph on the vertex set $V(G) = [n] = \{1,...,n\}$ and edge ideal $E(G)$. We consider the class of closed graphs. A closed graph is a simple graph satisfying the following property: for all edges $\{i, j\}$ and $\{k, \ell\}$ with $i < j$ and $k < \ell$ one has $\{j, \ell\}\in E(G)$ if $i = k$, and $\{i, k\}\in E(G)$ if $j = \ell$. We state some criteria for the closedness of a graph $G$ that do not depend necessarily from the labelling of its vertex set. Consequently, if $S = K[x_1,..., x_n, y_1,..., y_n]$ is a polynomial ring in $2n$ variables with coefficients in a field $K$, we obtain some criteria for the Koszulness of the quotient algebra $S /J_G$, where $J_G$ is the binomial edge ideal of $S$ i.e. the ideal generated by the binomials $f_{ij} = x_iy_j - x_jy_i$ such that $i<j$ and $\{i,j\}$ is an edge of $G$ (\cite{HH}).
A graph $G$ is well-covered if it has no isolated vertices and all the maximal independent sets have the same cardinality. If furthermore two times this cardinality is equal to $|V(G)|$, the graph $G$ is called very well-covered. The class of very well-covered graphs contains bipartite well-covered graphs. Recently in \cite{CRT} it is shown that a very well-covered graph $G$ is Cohen-Macaulay if and only if it is pure shellable. In this article we improve this result by showing that $G$ is Cohen-Macaulay if and only if it is pure vertex decomposable. In addition, if $I(G)$ denotes the edge ideal of $G$, we show that the Castelnuovo-Mumford regularity of $R/I(G)$ is equal to the maximum number of pairwise 3-disjoint edges of $G$. This improves Kummini's result on unmixed bipartite graphs.
We consider a class of graphs $G$ such that the height of the edge ideal $I(G)$ is half of the number $\sharp V(G)$ of the vertices. We give Cohen-Macaulay criteria for such graphs.