Search arXiv⌕ Search

arXiv · math/0411445

On the first infinitesimal neighborhood of a linear configuration of points in $\mathbb P^2$

Abstract

We consider the following open questions. Fix a Hilbert function, $h$, that occurs for a reduced zero-dimensional subscheme of $\mathbb P^2$. Among all subschemes, $X$, with Hilbert function $h$, what are the possible Hilbert functions and graded Betti numbers for the first infinitesimal neighborhood, $Z$, of $X$ (i.e. the double point scheme supported on $X$)? Is there a minimum ($h^{\min}$) and maximum ($h^{\max}$) such function? The numerical information encoded in $h$ translates to a {\it type vector}, which allows us to find unions of points on lines, called {\it linear configurations}, with Hilbert function $h$. We give necessary and sufficient conditions for the Hilbert function and graded Betti numbers of the first infinitesimal neighborhoods of {\it all} such linear configurations to be the same. Even for those $h$ for which the Hilbert functions or graded Betti numbers of the resulting double point schemes are not uniquely determined, we give one (depending only on $h$) that does occur. We prove the existence of $h^{\max}$, in general, and discuss $h^{\min}$. Our methods include liaison techniques.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

A. V. Geramita, J. Migliore, L. Sabourin. 2004-11-19. On the first infinitesimal neighborhood of a linear configuration of points in $\mathbb P^2$. https://arxiv.org/abs/math/0411445

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Mixed linkage of numerical semigroup ideals

We introduce principal and canonical linkage for relative ideals of a numerical semigroup $S$ and study their interaction modulo translation. On normalized $S$-reflexive ideals, a principal link followed by a canonical link acts by addition of the canonical ideal $K$. The resulting mixed components have paths as their underlying simple graphs, and their even liaison classes are chains under inclusion. If $r(K)$ is the positive reduction number of $K$, every even class has at most $r(K)$ elements and every mixed component has at most $2r(K)$ vertices. For components with a loop, the bound improves to $r(K)$. For semigroups of type two, we compute the even class of a given ideal from its occupied and gap blocks along arithmetic progressions and prove that the largest even class has exactly $r(K)$ elements. This equality can fail in type three. Both component bounds are sharp, and explicit families of embedding dimension three give components of unbounded size with and without loops.

math.AC↗

Hilbert Series in Four Variables and Linear Factors of High Multiplicity

Explicit sequences of forms with the Hilbert series predicted by Fröberg's conjecture are difficult to construct beyond the almost complete intersection case. Over a field of characteristic zero, we prove that six forms of degree $d\ge4$ in four variables cannot have the predicted series if each is divisible by a power of a linear form with exponent at least $(15d+91)/16$. A power of the product of six quadric cones gives a nonzero element of the inverse system in a degree where the predicted series vanishes. This obstruction implies that every fixed-order Taylor truncation of the homogeneous Rogers--Szegő polynomial at $q=1$ fails to complete five powers of linear forms to the predicted series in all sufficiently large degrees. As a fixed-degree counterpart, we use exact certificates to prove the conjecture for any number of general quintics or septics; together with known results, this establishes the equal-degree conjecture in four variables for $1\le d\le9$.

math.AC↗