Searcharxiv⌕ Search

arXiv subjects

Adam Van Tuyl

Publications and source records attributed to Adam Van Tuyl.

At least 91 records · Page 5Linked to original sources
arXiv2009

Simplicial complexes and Macaulay's inverse systems

Let $Δ$ be a simplicial complex on $V = \{x_1,...,x_n\}$, with Stanley-Reisner ideal $I_Δ\subseteq R = k[x_1,...,x_n]$. The goal of this paper is to investigate the class of artinian algebras $A=A(Δ,a_1,...,a_n)= R/(I_Δ,x_1^{a_1},...,x_n^{a_n})$, where each $a_i \geq 2$. By utilizing the technique of Macaulay's inverse systems, we can explicitly describe the socle of $A$ in terms of $Δ$. As a consequence, we determine the simplicial complexes, that we will call {\em levelable}, for which there exists a tuple $(a_1,...,a_n)$ such that $A(Δ,a_1,...,a_n)$ is a level algebra.

math.AC↗
arXiv2009

Splittings of monomial ideals

We provide some new conditions under which the graded Betti numbers of a monomial ideal can be computed in terms of the graded Betti numbers of smaller ideals, thus complementing Eliahou and Kervaire's splitting approach. As applications, we show that edge ideals of graphs are splittable, and we provide an iterative method for computing the Betti numbers of the cover ideals of Cohen-Macaulay bipartite graphs. Finally, we consider the frequency with which one can find particular splittings of monomial ideals and raise questions about ideals whose resolutions are characteristic-dependent.

math.AC↗
arXiv2008

Zero-nonzero patterns for nilpotent matrices over finite fields

Fix a field F. A zero-nonzero pattern A is said to be potentially nilpotent over F if there exists a matrix with entries in F with zero-nonzero pattern A that allows nilpotence. In this paper we initiate an investigation into which zero-nonzero patterns are potentially nilpotent over F, with a special emphasis on the case that F = Z_p is a finite field. As part of this investigation, we develop methods, using the tools of algebraic geometry and commutative algebra, to eliminate zero-nonzero patterns A as being potentially nilpotent over any field F. We then use these techniques to classify all irreducible zero-nonzero patterns of order two and three that are potentially nilpotent over Z_p for each prime p.

math.RA↗
arXiv2008

Separators of points in a multiprojective space

In this note we develop some of the properties of separators of points in a multiprojective space. In particular, we prove multigraded analogs of results of Geramita, Maroscia, and Roberts relating the Hilbert function of X and X \{P} via the degree of a separator, and Abrescia, Bazzotti, and Marino relating the degree of a separator to shifts in the minimal multigraded free resolution of the ideal of points.

math.AC↗
arXiv2007

ACM sets of points in multiprojective space

If X is a finite set of points in a multiprojective space P^n1 x ... x P^nr with r >= 2, then X may or may not be arithmetically Cohen-Macaulay (ACM). For sets of points in P^1 x P^1 there are several classifications of the ACM sets of points. In this paper we investigate the natural generalizations of these classifications to an arbitrary multiprojective space. We show that each classification for ACM points in P^1 x P^1 fails to extend to the general case. We also give some new necessary and sufficient conditions for a set of points to be ACM.

math.AC↗
arXiv2007

Shellable graphs and sequentially Cohen-Macaulay bipartite graphs

Associated to a simple undirected graph G is a simplicial complex whose faces correspond to the independent sets of G. We call a graph G shellable if this simplicial complex is a shellable simplicial complex in the non-pure sense of Bjorner-Wachs. We are then interested in determining what families of graphs have the property that G is shellable. We show that all chordal graphs are shellable. Furthermore, we classify all the shellable bipartite graphs; they are precisely the sequentially Cohen-Macaulay bipartite graphs. We also give an recursive procedure to verify if a bipartite graph is shellable. Because shellable implies that the associated Stanley-Reisner ring is sequentially Cohen-Macaulay, our results complement and extend recent work on the problem of determining when the edge ideal of a graph is (sequentially) Cohen-Macaulay. We also give a new proof for a result of Faridi on the sequentially Cohen-Macaulayness of simplicial forests.

math.CO↗
arXiv2007

Monomial ideals, edge ideals of hypergraphs, and their graded Betti numbers

We use the correspondence between hypergraphs and their associated edge ideals to study the minimal graded free resolution of squarefree monomial ideals. The theme of this paper is to understand how the combinatorial structure of a hypergraph H appears within the resolution of its edge ideal I(H). We discuss when recursive formulas to compute the graded Betti numbers of I(H) in terms of its sub-hypergraphs can be obtained; these results generalize our previous work on the edge ideals of simple graphs. We introduce a class of hypergraphs, which we call properly-connected, that naturally generalizes simple graphs from the point of view that distances between intersecting edges are ``well behaved''. For such a hypergraph H (and thus, for any simple graph), we give a lower bound for the regularity of I(H) via combinatorial information describing H, and an upper bound for the regularity when H = G is a simple graph. We also introduce triangulated hypergraphs, a properly-connected hypergraph which is a generalization of chordal graphs. When H is a triangulated hypergraph, we explicitly compute the regularity of I(H) and show that the graded Betti numbers of I(H) are independent of the ground field. As a consequence, many known results about the graded Betti numbers of forests can now be extended to chordal graphs.

math.AC↗
arXiv2007

The minimal resolutions of double points in P^1 x P^1 with ACM support

Let Z be a finite set of double points in P^1 x P^1 and suppose further that X, the support of Z, is arithmetically Cohen-Macaulay (ACM). We present an algorithm, which depends only upon a combinatorial description of X, for the bigraded Betti numbers of I_Z, the defining ideal of Z. We then relate the total Betti numbers of I_Z to the shifts in the graded resolution, thus answering a special case of a question of T. Roemer.

math.AC↗
arXiv2006

Some families of componentwise linear monomial ideals

Let R=k[x_1,...,x_n] be a polynomial ring over a field k. Let J={j_1,...,j_t} be a subset of [n]={1,...,n}, and let m_J denote the ideal (x_{j_1},...,x_{j_t}) of R. Given subsets J_1,...,J_s of [n] and positive integers a_1,...,a_s, we study ideals of the form I=m_{J_1}^{a_1} \cap ... \cap m_{J_s}^{a_s}. These ideals arise naturally, for example, in the study of fat points, tetrahedral curves, and Alexander duality of squarefree monomial ideals. Our main focus is determining when ideals of this form are componentwise linear. Using polymatroidality, we prove that I is always componentwise linear when s <= 3 or when J_i \cup J_j = [n] for all i \neq j. When s >= 4, we give examples to show that I may or may not be componentwise linear. We apply these results to ideals of small sets of general fat points in multiprojective space, and we extend work of Fatabbi, Lorenzini, Valla, and the first author by computing the graded Betti numbers in the s=2 case. Since componentwise linear ideals satisfy the Multiplicity Conjecture of Herzog, Huneke, and Srinivasan when char(k)=0, our work also yields new cases in which this conjecture holds.

math.AC↗
arXiv2006

Splittable ideals and the resolutions of monomial ideals

We provide a new combinatorial approach to study the minimal free resolutions of edge ideals, that is, quadratic square-free monomial ideals. With this method we can recover most of the known results on resolutions of edge ideals with fuller generality, and at the same time, obtain new results. Past investigations on the resolutions of edge ideals usually reduced the problem to computing the dimensions of reduced homology or Koszul homology groups. Our approach circumvents the highly nontrivial problem of computing the dimensions of these groups and turns the problem into combinatorial questions about the associated simple graph. We also show that our technique extends successfully to the study of graded Betti numbers of arbitrary square-free monomial ideals viewed as facet ideals of simplicial complexes.

math.AC↗
arXiv2006

On the linear strand of an edge ideal

Let I(G) be the edge ideal associated to a simple graph G. We study the graded Betti numbers that appear in the linear strand of the minimal free resolution of I(G).

math.AC↗
arXiv2006

Sequentially Cohen-Macaulay Edge Ideals

Let G be a simple undirected graph on n vertices, and let I(G) \subseteq R = k[x_1,...,x_n] denote its associated edge ideal. We show that all chordal graphs G are sequentially Cohen-Macaulay; our proof depends upon showing that the Alexander dual of I(G) is componentwise linear. Our result complements Faridi's theorem that the facet ideal of a simplicial tree is sequentially Cohen-Macaulay and implies Herzog, Hibi, and Zheng's theorem that a chordal graph is Cohen-Macaulay if and only if its edge ideal is unmixed. We also characterize the sequentially Cohen-Macaulay cycles and produce some examples of nonchordal sequentially Cohen-Macaulay graphs.

math.AC↗
arXiv2005

Multigraded regularity: coarsenings and resolutions

Let S = k[x_1,...,x_n] be a Z^r-graded ring with deg (x_i) = a_i \in Z^r for each i and suppose that M is a finitely generated Z^r-graded S-module. In this paper we describe how to find finite subsets of Z^r containing the multidegrees of the minimal multigraded syzygies of M. To find such a set, we first coarsen the grading of M so that we can view M as a Z-graded S-module. We use a generalized notion of Castelnuovo-Mumford regularity, which was introduced by D. Maclagan and G. Smith, to associate to M a number which we call the regularity number of M. The minimal degrees of the multigraded minimal syzygies are bounded in terms of this invariant.

math.AC↗
arXiv2005

Multigraded regularity: syzygies and fat points

The Castelnuovo-Mumford regularity of a graded ring is an important invariant in computational commutative algebra, and there is increasing interest in multigraded generalizations. We study connections between two recent definitions of multigraded regularity with a view towards a better understanding of the multigraded Hilbert function of fat point schemes in P^{n_1} x ... x P^{n_k}.

math.AC↗
arXiv2005

Powers of complete intersections: graded Betti numbers and applications

Let I = (F_1,...,F_r) be a homogeneous ideal of R = k[x_0,...,x_n] generated by a regular sequence of type (d_1,...,d_r). We give an elementary proof for an explicit description of the graded Betti numbers of I^s for any s \geq 1. These numbers depend only upon the type and s. We then use this description to: (1) write H_{R/I^s}, the Hilbert function of R/I^s, in terms of H_{R/I}; (2) verify that the k-algebra R/I^s satisfies a conjecture of Herzog-Huneke-Srinivasan; and (3) obtain information about the numerical invariants associated to sets of fat points in P^n whose support is a complete intersection or a complete intersection minus a point.

math.AC↗
arXiv2004

On the defining ideal of a set of points in multi-projective space

We investigate the defining ideal of a set of points X in multi-projective space with a special emphasis on the case that X is in generic position, that is, X has the maximal Hilbert function. When X is in generic position, we determine the degrees of the generators of the associated ideal I_X. Letting ν(I_X) denote the minimal number of generators of I_X, we use this description of the degrees to construct a function v(s;n_1,...,n_k) with the property that ν(\Ix) >= v(s;n_1,...,n_k) always holds for s points in generic position in P^{n_1} x ... x P^{n_k}. When k=1, v(s;n_1) equals the expected value for ν(I_X) as predicted by the Ideal Generation Conjecture. If k >= 2, we show that there are cases with ν(\Ix) > v(s;n_1,...,n_k). However, computational evidence suggests that in many cases ν(\Ix) = v(s;n_1,...,n_k).

math.AC↗
arXiv2003

The regularity of points in multi-projective spaces

Let I = p_1^{m_1} \cap ... \cap p_s^{m_s} be the defining ideal of a scheme of fat points in P^{n_1} x ... x P^{n_k} with support in generic position. When all the m_i's are 1, we explicitly calculate the Castelnuovo-Mumford regularity of I. In general, if at least one m_i >= 2, we give an upper bound for the regularity of I, which extends the result of Catalisano, Trung and Valla to the multi-projective case.

math.AC↗