arXiv subjects
Publications and source records attributed to Adam Van Tuyl.
We compute the Castelnuovo-Mumford regularity of the edge ideals of two families of circulant graphs, which includes all cubic circulant graphs. A feature of our approach is to combine bounds on the regularity, the projective dimension, and the reduced Euler characteristic to derive an exact value for the regularity.
It is well-known that the zero forcing number of a graph provides a lower bound on the minimum rank of a graph. In this paper we bound and characterize the zero forcing number of certain circulant graphs, including some bipartite circulants, cubic circulants, and circulants which are torus products, to obtain bounds on the minimum rank and the maximum nullity. We also evaluate when the zero forcing number will give equality.
We compute the graded Betti numbers for the toric ideal of a family of graphs constructed by adjoining a cycle to a complete bipartite graph. The key observation is that this family admits an initial ideal which has linear quotients. As a corollary, we compute the Hilbert series and $h$-vector for all the toric ideals of graphs in this family.
For any two integers $d,r \geq 1$, we show that there exists an edge ideal $I(G)$ such that the ${\rm reg}\left(R/I(G)\right)$, the Castelnuovo-Mumford regularity of $R/I(G)$, is $r$, and ${\rm deg} (h_{R/I(G)}(t))$, the degree of the $h$-polynomial of $R/I(G)$, is $d$. Additionally, if $G$ is a graph on $n$ vertices, we show that ${\rm reg}\left(R/I(G)\right) + {\rm deg} (h_{R/I(G)}(t)) \leq n$.
Let $I$ be a homogeneous ideal of $\Bbbk[x_0,\ldots,x_n]$. To compare $I^{(m)}$, the $m$-th symbolic power of $I$, with $I^m$, the regular $m$-th power, we introduce the $m$-th symbolic defect of $I$, denoted $\operatorname{sdefect}(I,m)$. Precisely, $\operatorname{sdefect}(I,m)$ is the minimal number of generators of the $R$-module $I^{(m)}/I^m$, or equivalently, the minimal number of generators one must add to $I^m$ to make $I^{(m)}$. In this paper, we take the first step towards understanding the symbolic defect by considering the case that $I$ is either the defining ideal of a star configuration or the ideal associated to a finite set of points in $\mathbb{P}^2$. We are specifically interested in identifying ideals $I$ with $\operatorname{sdefect}(I,2) = 1$.
A square-free monomial ideal $I$ of $k[x_1,\ldots,x_n]$ is said to be an $f$-ideal if the facet complex and non-face complex associated with $I$ have the same $f$-vector. We show that $I$ is an $f$-ideal if and only if its Newton complementary dual $\widehat{I}$ is also an $f$-ideal. Because of this duality, previous results about some classes of $f$-ideals can be extended to a much larger class of $f$-ideals. An interesting by-product of our work is an alternative formulation of the Kruskal-Katona theorem for $f$-vectors of simplicial complexes.
We focus our attention on well-covered graphs that are vertex decomposable. We show that for many known families of these vertex decomposable graphs, the set of shedding vertices forms a dominating set. We then construct three new infinite families of well-covered graphs, none of which have this property. We use these results to provide a minimal counterexample to a conjecture of Villarreal regarding Cohen-Macaulay graphs.
A $\Bbbk$-configuration is a set of points $\mathbb{X}$ in $\mathbb{P}^2$ that satisfies a number of geometric conditions. Associated to a $\Bbbk$-configuration is a sequence $(d_1,\ldots,d_s)$ of positive integers, called its type, which encodes many of its homological invariants. We distinguish $\Bbbk$-configurations by counting the number of lines that contain $d_s$ points of $\mathbb{X}$. In particular, we show that for all integers $m \gg 0$, the number of such lines is precisely the value of $Δ\mathbf{H}_{m\mathbb{X}}(m d_s -1)$. Here, $Δ\mathbf{H}_{m\mathbb{X}}(-)$ is the first difference of the Hilbert function of the fat points of multiplicity $m$ supported on $\mathbb{X}$.
Bocci, Carlini, and Kileel have shown that the square-free Hadamard product of a finite set of points $Z$ that all lie on a line $\ell$ in $\mathbb{P}^n$ produces a star configuration of codimension $n$. In this paper we introduce a construction using the Hadamard product to construct star configurations of codimension $c$. In the case that $c = n= 2$, our construction produces the star configurations of Bocci, Carlini, and Kileel. We will call any star configuration that can be constructed using our approach a Hadamard star configuration. Our main result is a classification of Hadamard star configurations.
Ehrenborg, Govindaiah, Park, and Readdy recently introduced the van der Waerden complex, a pure simplicial complex whose facets correspond to arithmetic progressions. Using techniques from combinatorial commutative algebra, we classify when these pure simplicial complexes are vertex decomposable or not Cohen-Macaulay. As a corollary, we classify the van der Waerden complexes that are shellable.
We explore how the combinatorial arrangement of prescribed zeros in a matrix affects the possible eigenvalues that the matrix can obtain. We demonstrate that there are inertially arbitrary patterns having a digraph with no 2-cycle, unlike what happens for nonzero patterns. We develop a class of patterns that are refined inertially arbitrary but not spectrally arbitrary, making use of the property of a properly signed nest. We include a characterization of the inertially arbitrary and refined inertially arbitrary patterns of order three, as well as the patterns of order four with the least number of nonzero entries.
Given a squarefree monomial ideal $I \subseteq R =k[x_1,\ldots,x_n]$, we show that $\widehatα(I)$, the Waldschmidt constant of $I$, can be expressed as the optimal solution to a linear program constructed from the primary decomposition of $I$. By applying results from fractional graph theory, we can then express $\widehatα(I)$ in terms of the fractional chromatic number of a hypergraph also constructed from the primary decomposition of $I$. Moreover, expressing $\widehatα(I)$ as the solution to a linear program enables us to prove a Chudnovsky-like lower bound on $\widehatα(I)$, thus verifying a conjecture of Cooper-Embree-Hà-Hoefel for monomial ideals in the squarefree case. As an application, we compute the Waldschmidt constant and the resurgence for some families of squarefree monomial ideals. For example, we determine both constants for unions of general linear subspaces of $\mathbb{P}^n$ with few components compared to $n$, and we find the Waldschmidt constant for the Stanley-Reisner ideal of a uniform matroid.
Let $G$ be a finite simple graph. We give a lower bound for the Castelnuovo-Mumford regularity of the toric ideal $I_G$ associated to $G$ in terms of the sizes and number of induced complete bipartite graphs in $G$. When $G$ is a chordal bipartite graph, we find an upper bound for the regularity of $I_G$ in terms of the size of the bipartition of $G$. We also give a new proof for the graded Betti numbers of the toric ideal associated to the complete bipartite graph $K_{2,n}$.
We investigate when the independence complex of $G[H]$, the lexicographical product of two graphs $G$ and $H$, is either vertex decomposable or shellable. As an application, we construct an infinite family of graphs with the property that every graph in this family has the property that the independence complex of each graph is shellable, but not vertex decomposable.
We study the independence complexes of families of well-covered circulant graphs discovered by Boros-Gurvich-Milanič, Brown-Hoshino, and Moussi. Because these graphs are well-covered, their independence complexes are pure simplicial complexes. We determine when these pure complexes have extra combinatorial (e.g. vertex decomposable, shellable) or topological (e.g. Cohen-Macaulay, Buchsbaum) structure. We also provide a table of all well-covered circulant graphs on 16 or less vertices, and for each such graph, determine if it is vertex decomposable, shellable, Cohen-Macaulay, and/or Buchsbaum. A highlight of this search is an example of a graph whose independence complex is shellable but not vertex decomposable.
Let H_X be the trigraded Hilbert function of a set X of reduced points in P^1 x P^1 x P^1. We show how to extract some geometric information about X from H_X. This note generalizes a similar result of Giuffrida, Maggioni, and Ragusa about sets of points in P^1 x P^1.
Let $I$ be a square-free monomial ideal in $R = k[x_1,\ldots,x_n]$, and consider the sets of associated primes ${\rm Ass}(I^s)$ for all integers $s \geq 1$. Although it is known that the sets of associated primes of powers of $I$ eventually stabilize, there are few results about the power at which this stabilization occurs (known as the index of stability). We introduce a family of square-free monomial ideals that can be associated to a finite simple graph $G$ that generalizes the cover ideal construction. When $G$ is a tree, we explicitly determine ${\rm Ass}(I^s)$ for all $s \geq 1$. As consequences, not only can we compute the index of stability, we can also show that this family of ideals has the persistence property.
We revisit the problem of computing the spreading and covering numbers. We show a connection between some of the spreading numbers and the number of non-negative integer 2x2 matrices whose entries sum to d, and we construct an algorithm to compute improved upper bounds for the covering numbers.