We give a notion of combinatorial proximity among strongly stable ideals in a given polynomial ring with a fixed Hilbert polynomial. We show that this notion guarantees geometric proximity of the corresponding points in the Hilbert scheme. We define
a graph whose vertices correspond to strongly stable ideals and whose edges correspond to pairs of adjacent ideals. Every term order induces an orientation of the edges of the graph. This directed graph describes the behavior of the points of the Hilbert scheme under Grobner degenerations with respect to the given term order. Then, we introduce a polyhedral fan that we call Grobner fan of the Hilbert scheme. Each cone of maximal dimension corresponds to a different directed graph induced by a term order. This fan encodes several properties of the Hilbert scheme. We use these tools to present a new proof of the connectedness of the Hilbert scheme. Finally, we improve the technique introduced in the paper Double-generic initial ideal and Hilbert scheme by Bertone, Cioffi and Roggero to give a lower bound on the number of irreducible components of the Hilbert scheme.
Let $P_{text{MAX}}(d,s)$ denote the maximum arithmetic genus of a locally Cohen-Macaulay curve of degree $d$ in $mathbb{P}^3$ that is not contained in a surface of degree $<s$. A bound $P(d, s)$ for $P_{text{MAX}}(d,s)$ has been proven by the first a
uthor in characteristic zero and then generalized in any characteristic by the third author. In this paper, we construct a large family $mathcal{C}$ of primitive multiple lines and we conjecture that the generic element of $mathcal{C}$ has good cohomological properties. With the aid of emph{Macaulay2} we checked the validity of the conjecture for $s leq 100$. From the conjecture it would follow that $P(d,s)= P_{text{MAX}}(d,s)$ for $d=s$ and for every $d geq 2s-1$.
We construct stable vector bundles on the space of symmetric forms of degree d in n+1 variables which are equivariant for the action of SL_{n+1}(C), and admit an equivariant free resolution of length 2. For n=1, we obtain new examples of stable vecto
r bundles of rank d-1 on P^d, which are moreover equivariant for SL_2(C). The presentation matrix of these bundles attains Westwicks upper bound for the dimension of vector spaces of matrices of constant rank and fixed size.
We give a new method to construct linear spaces of matrices of constant rank, based on truncated graded cohomology modules of certain vector bundles as well as on the existence of graded Artinian modules with pure resolutions. Our method allows one t
o produce several new examples, and provides an alternative point of view on the existing ones.
The texttt{StronglyStableIdeals} package for textit{Macaulay2} provides a method to compute all saturated strongly stable ideals in a given polynomial ring with a fixed Hilbert polynomial. A description of the main method and auxiliary tools is given.
The goal of this paper is to explicitly detect all the arithmetic genera of arithmetically Cohen-Macaulay projective curves with a given degree $d$. It is well-known that the arithmetic genus $g$ of a curve $C$ can be easily deduced from the $h$-vect
or of the curve; in the case where $C$ is arithmetically Cohen-Macaulay of degree $d$, $g$ must belong to the range of integers $big{0,ldots,binom{d-1}{2}big}$. We develop an algorithmic procedure that allows one to avoid constructing most of the possible $h$-vectors of $C$. The essential tools are a combinatorial description of the finite O-sequences of multiplicity $d$, and a sort of continuity result regarding the generation of the genera. The efficiency of our method is supported by computational evidence. As a consequence, we single out the minimal possible Castelnuovo-Mumford regularity of a curve with Cohen-Macaulay postulation and given degree and genus.
The application of methods of computational algebra has recently introduced new tools for the study of Hilbert schemes. The key idea is to define flat families of ideals endowed with a scheme structure whose defining equations can be determined by al
gorithmic procedures. For this reason, several authors developed new methods, based on the combinatorial properties of Borel-fixed ideals, that allow to associate to each ideal $J$ of this type a scheme $mathbf{Mf}_{J}$, called $J$-marked scheme. In this paper we provide a solid functorial foundation to marked schemes and show that the algorithmic procedures introduced in previous papers do not depend on the ring of coefficients. We prove that for all strongly stable ideals $J$, the marked schemes $mathbf{Mf}_{J}$ can be embedded in a Hilbert scheme as locally closed subschemes, and that they are open under suitable conditions on $J$. Finally, we generalize Lederers result about Grobner strata of zero-dimensional ideals, proving that Grobner strata of any ideals are locally closed subschemes of Hilbert schemes.
Let $K$ be an algebraically closed field of null characteristic and $p(z)$ a Hilbert polynomial. We look for the minimal Castelnuovo-Mumford regularity $m_{p(z)}$ of closed subschemes of projective spaces over $K$ with Hilbert polynomial $p(z)$. Expe
rimental evidences led us to consider the idea that $m_{p(z)}$ could be achieved by schemes having a suitable minimal Hilbert function. We give a constructive proof of this fact. Moreover, we are able to compute the minimal Castelnuovo-Mumford regularity $m_p(z)^{varrho}$ of schemes with Hilbert polynomial $p(z)$ and given regularity $varrho$ of the Hilbert function, and also the minimal Castelnuovo-Mumford regularity $m_u$ of schemes with Hilbert function $u$. These results find applications in the study of Hilbert schemes. They are obtained by means of minimal Hilbert functions and of two new constructive methods which are based on the notion of growth-height-lexicographic Borel set and called ideal graft and extended lifting.
Borel-fixed ideals play a key role in the study of Hilbert schemes. Indeed each component and each intersection of components of a Hilbert scheme contains at least one Borel-fixed point, i.e. a point corresponding to a subscheme defined by a Borel-fi
xed ideal. Moreover Borel-fixed ideals have good combinatorial properties, which make them very interesting in an algorithmic perspective. In this paper, we propose an implementation of the algorithm computing all the saturated Borel-fixed ideals with number of variables and Hilbert polynomial assigned, introduced from a theoretical point of view in the paper Segment ideals and Hilbert schemes of points, Discrete Mathematics 311 (2011).
In this PhD thesis we propose an algorithmic approach to the study of the Hilbert scheme. Developing algorithmic methods, we also obtain general results about Hilbert schemes. In Chapter 1 we discuss the equations defining the Hilbert scheme as subsc
heme of a suitable Grassmannian and in Chapter 5 we determine a new set of equations of degree lower than the degree of equations known so far. In Chapter 2 we study the most important objects used to project algorithmic techniques, namely Borel-fixed ideals. We determine an algorithm computing all the saturated Borel-fixed ideals with Hilbert polynomial assigned and we investigate their combinatorial properties. In Chapter 3 we show a new type of flat deformations of Borel-fixed ideals which lead us to give a new proof of the connectedness of the Hilbert scheme. In Chapter 4 we construct families of ideals that generalize the notion of family of ideals sharing the same initial ideal with respect to a fixed term ordering. Some of these families correspond to open subsets of the Hilbert scheme and can be used to a local study of the Hilbert scheme. In Chapter 6 we deal with the problem of the connectedness of the Hilbert scheme of locally Cohen-Macaulay curves in the projective 3-space. We show that one of the Hilbert scheme considered a good candidate to be non-connected, is instead connected. Moreover there are three appendices that present and explain how to use the implementations of the algorithms proposed.
