arXiv math/04110202004-11math.ACmath.AG

Resolutions of small sets of fat points

Christopher Francisco

备注：: 15 pages; very minor revisions plus some additional references; to appear in JPAA
发表信息：: J. Pure Appl. Algebra 203 (2005), 220-236

英文摘要：

We investigate the minimal graded free resolutions of ideals of at most n+1 fat points in general position in P^n. Our main theorem is that these ideals are componentwise linear. This result yields a number of corollaries, including the multiplicity conjecture of Herzog, Huneke, and Srinivasan in this case. On the computational side, using an iterated mapping cone process, we compute formulas for the graded Betti numbers of ideals associated to two fat points in P^n, verifying a conjecture of Fatabbi, and at most n+1 general double points in P^n.

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

阅读原文

阅读 PDF ↗

arXiv 页面 ↗HTML 原文 ↗

本文内容

英文摘要相关论文

机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。

继续探索

相关论文

Resolutions of ideals of six fat points in P^2

The graded Betti numbers of the minimal free resolution (and also therefore the Hilbert function) of the ideal of a fat point subscheme Z of P^2 are determined whenever Z is supported at any 6 or fewer distinct points. All results hold over an algebraically closed field k of arbitrary characteristic.

2012-04-13math.ACmath.AG

On the minimal free resolution for fat point schemes of multiplicity at most 3 in P^2

Let Z be a fat point scheme in P^2 supported on general points. Here we prove that if the multiplicities are at most 3 and the length of Z is sufficiently high then the number of generators of the homogeneous ideal I_Z in each degree is as small as numerically possible. Since it is known that Z has maximal Hilbert function, this implies that Z has the expected minimal free resolution.

2007-10-08math.ACmath.AG

Resolutions of fat point ideals involving 8 general points of P2

The main result provides an algorithm for determining the minimal free resolution of ideals of fat point subschemes of ${\bf P}^2$ involving up to 8 general points with arbitrary multiplicities; the results hold over algebraically closed fields of any characteristic. The algorithm, which works by giving a formula in certain cases and a reduction to these cases otherwise, does not involve Gröbner bases, and so is very fast, even for very large multiplicities. Partial information is also obtained in certain cases with $n>8$.

2001-01-12math.ACmath.AG

The minimal free resolution of fat almost complete intersections in $\mathbb{P}^1\times\mathbb{P}^1$

A current research theme is to compare symbolic powers of an ideal $I$ with the regular powers of $I$. In this paper, we focus on the case that $I=I_X$ is an ideal defining an almost complete intersection (ACI) sets of points $X$ in $\mathbb{P}^1\times\mathbb{P}^1$. In particular, we describe a minimal free bigraded resolution of a non arithmetically Cohen-Macaulay (also non homogeneus) set of fat points $\mathcal Z$ whose support is an ACI. We call $\mathcal Z$ a fat ACI. We also show that its symbolic and ordinary powers are equal, i.e, $I_{\mathcal Z}^{(m)}=I_{\mathcal Z}^{m}$ for any $m\ge…

2016-11-02math.ACmath.AG

Hilbert functions and resolutions for ideals of n = s^2 fat points in P2

Conjectures for the Hilbert function of the m-th symbolic power of the ideal of n general points of P2 are verified for infinitely many m for each square n > 9, using an approach developed by the authors in a previous paper. In those cases that n is even, conjectures for the resolution are also verified. Previously, by work of Evain (for the Hilbert function) and of Harbourne, Holay and Fitchett (for the resolution), these conjectures were known for infinitely many m for a given n > 9 only for n being a power of 4.

2001-04-26math.ACmath.AG

Resolutions of Ideals of Uniform Fat Point Subschemes of P^2

Let I be the ideal corresponding to a set of general points $p_1,...,p_n \in P^2$. There recently has been progress in showing that a naive lower bound for the Hilbert functions of symbolic powers $I^{(m)}$ is in fact attained when n>9. Here, for m sufficiently large, the minimal free graded resolution of $I^{(m)}$ is determined when n>9 is an even square, assuming only that this lower bound on the Hilbert function is attained. Under ostensibly stronger conditions (that are nonetheless expected always to hold), a similar result is shown to hold for odd squares, and for infinitely many m for ea…

1999-06-18math.ACmath.AG

更多相关论文收起更多论文

Resolutions of ideals of fat points with support in a hyperplane

Our results concern minimal graded free resolutions of fat point ideals for points in a hyperplane. Suppose, for example, that I(m,d) is the ideal defining r given points of multiplicity m in the projective space P^d. Assume that the given points lie in a hyperplane P^{d-1} in P^d, and that the ground field k is algebraically closed of characteristic 0. We give an explicit minimal graded free resolution of I(m,d) in k[P^d] in terms of the minimal graded free resolutions of the ideals I(j,d-1) in k[P^{d-1}] with j < m+1. As a corollary, we give the following formula for the Poincare polynomial …

2005-07-11math.ACmath.AG

The interpolation problem for a set of three fat points in $\mathbb{P}^1\times\mathbb{P}^1$

This is an appendix to the recent paper of Favacchio and Guardo. In these notes we describe explicitly a minimal bigraded free resolution and the bigraded Hilbert function of a set of 3 fat points whose support is an almost complete intersection (ACI) in $\mathbb{P}^1\times\mathbb{P}^1.$ This solve the interpolation problem for three points with an ACI support.

2017-01-13math.ACmath.AG

On the Hilbert function of general fat points in $\mathbb{P}^1 \times \mathbb{P}^1$

We study the bi-graded Hilbert function of ideals of general fat points with same multiplicity in $\mathbb{P}^1\times\mathbb{P}^1$. Our first tool is the multiprojective-affine-projective method introduced by the second author in previous works with A.V. Geramita and A. Gimigliano where they solved the case of double points. In this way, we compute the Hilbert function when the smallest entry of the bi-degree is at most the multiplicity of the points. Our second tool is the differential Horace method introduced by J. Alexander and A. Hirschowitz to study the Hilbert function of sets of fat poi…

2017-11-25math.ACmath.AG

Betti numbers of fat forests and their Alexander dual

Let $k$ be a field and $R=k[x_1,\ldots,x_n]/I=S/I$ a graded ring. Then $R$ has a $t$-linear resolution if $I$ is generated by homogeneous elements of degree $t$, and all higher syzygies are linear. Thus $R$ has a $t$-linear resolution if ${\rm Tor}^S_{i,j}(S/I,k)=0$ if $j\ne i+t-1$. For a simplicial complex $Δ$ on $[{\bf n}]=\{1,\ldots,n\}$ and a field $k$, the Stanley-Reisner ring $k[Δ]$ is $k[x_1,\ldots,x_n]/I$, where $I$ is generated by those squarefree monomials $x_{i_1}\cdots x_{i_k}$ for which $\{ i_1,\ldots,i_k\}$ does not belong to $Δ$. In \cite{Fr} the Stanley-Reisner rings with 2-lin…

2022-04-13math.ACmath.CO

Fat Points in P^1 x P^1 and their Hilbert Functions

We study the Hilbert functions of fat points in P^1 x P^1. If Z is an arbitrary fat point subscheme of P^1 x P^1, then it can be shown that for every i and j the values of the Hilbert function H_Z(l,j) and H_Z(i,l) eventually become constant for l >> 0. We show how to determine these eventual values by using only the multiplicities of the points, and the relative positions of the points in P^1 x P^1. This enables us to compute all but a finite number values of H_Z without using the coordinates of points. We also characterize the ACM fat points schemes using our description of the eventual beha…

2002-11-04math.ACmath.AG

Problems and progress: survey on fat points in P2

This paper surveys certain problems involving numerical characters for ideals I(Z) defining fat points subschemes $Z=m_1p_1+...+m_np_n$ for general points $p_i\in {\bf P}^2$. It also presents some new results, and includes a suite of MACAULAY 2 scripts for computing actual or conjectured values of (or bounds on) these characters. One such script, for example, is findres, which implements an algorithm due to Fitchett, Harbourne and Holay for computing the syzygy modules in a minimal free resolution of the ideal I(Z) for any such Z with n<=8; since findres does not rely on a Gröbner basis calcul…

2001-01-12math.ACmath.AG

Separators of fat points in P^n

In this paper we extend the definition of a separator of a point P in P^n to a fat point P of multiplicity m. The key idea in our definition is to compare the fat point schemes Z = m_1P_1 + ... + m_iP_i + .... + m_sP_s in P^n and Z' = m_1P_1 + ... + (m_i-1)P_i + .... + m_sP_s. We associate to P_i a tuple of positive integers of length v = deg Z - deg Z'. We call this tuple the degree of the minimal separators of P_i of multiplicity m_i, and we denote it by deg_Z(P_i) = (d_1,...,d_v). We show that if one knows deg_Z(P_i) and the Hilbert function of Z, one will also know the Hilbert function of …

2010-07-09math.ACmath.AG

An Algorithm for Fat Points on P2

Let $F$ be a line bundle on the blow-up $X$ of $P^2$ at $r$ general points $p_1, ..., p_r$ and let $L$ be the pullback to $X$ of the line bundle coming from a line on $P^2$. Under reasonable hypotheses that are conjectured always to hold if the points $p_1, ..., p_r$ are sufficiently general, it is shown that the computation of the dimension of the cokernel of the natural map $μ_F:Γ(F)\otimesΓ(L)\toΓ(F\otimes L)$ reduces to the case that $F$ is ample. As an application, a complete determination of the dimension of the cokernel of $μ_F$ is obtained when $r\le 7$, thereby solving the Ideal Gener…

1999-09-16math.ACmath.AG

Bounding invariants of fat points using a coding theory construction

Let $Z \subseteq \proj{n}$ be a fat points scheme, and let $d(Z)$ be the minimum distance of the linear code constructed from $Z$. We show that $d(Z)$ imposes constraints (i.e., upper bounds) on some specific shifts in the graded minimal free resolution of $I_Z$, the defining ideal of $Z$. We investigate this relation in the case that the support of $Z$ is a complete intersection; when $Z$ is reduced and a complete intersection we give lower bounds for $d(Z)$ that improve upon known bounds.

2012-03-29math.AC

Combinatorial bounds on Hilbert functions of fat points in projective space

We study Hilbert functions of certain non-reduced schemes A supported at finite sets of points in projective space, in particular, fat point schemes. We give combinatorially defined upper and lower bounds for the Hilbert function of A using nothing more than the multiplicities of the points and information about which subsets of the points are linearly dependent. When N=2, we give these bounds explicitly and we give a sufficient criterion for the upper and lower bounds to be equal. When this criterion is satisfied, we give both a simple formula for the Hilbert function and combinatorially defi…

2010-12-11math.ACmath.AG

Resolutions of Subsets of Finite Sets of Points in Projective Space

Given a finite set, $X$, of points in projective space for which the Hilbert function is known, a standard result says that there exists a subset of this finite set whose Hilbert function is ``as big as possible'' inside $X$. Given a finite set of points in projective space for which the minimal free resolution of its homogeneous ideal is known, what can be said about possible resolutions of ideals of subsets of this finite set? We first give a maximal rank type description of the most generic possible resolution of a subset. Then we show that this generic resolution is not always achieved, by…

1999-06-29math.ACmath.AG