arXiv subjects

Adam Van Tuyl

Publications and source records attributed to Adam Van Tuyl.

At least 19 recordsLinked to original sources

arXiv2026

Edge codes constructed from unicyclic graphs

Jaramillo-Velez recently introduced edge codes, a new class of toric evaluation codes constructed from the edges of a (hyper)graph $\mathcal{H}$. In the case that $\mathcal{H}$ is a tree, Jaramillo-Velez computed both the minimum distance and the weight distribution of the associated code. In this paper, we study edge codes associated to unicyclic graphs. Our most striking result is that computing the parameters of these codes is subtle in the case that the induced cycle has an even length because these values will depend on certain conditions regarding the length of the cycle and the size of the base field.

math.CO↗

arXiv2026

Geometrically vertex decomposable star configurations

The goal of this paper is to determine how the family of ideals of star configurations intersects with the class of geometrically vertex decomposable ideals. The main result of this paper shows that the answer is subtle since the geometrically vertex decomposability property of an ideal is not invariant under a linear change of variables, and thus the answer will depend upon the choice of the linear forms that define the ideal of the star configuration. We also show that the ideal of a star configuration is a Knutson ideal precisely when it is a geometrically vertex decomposable ideal.

math.AC↗

arXiv2026

Trivariate Splines on Fans of Hyperplane Arrangements and Koszul Homology

We study the space of splines $\mathcal{S}^{\mathbf{r}}(\Sigma^\mathscr{A})$ where ${\mathbf{r}}$ denotes a smoothness distribution and $\Sigma^\mathscr{A}$ is the fan of a central hyperplane arrangement $\mathscr{A}$ in $\mathbb{R}^3$. This is the first step in the analysis of splines on three-dimensional cross-cut partitions, which naturally generalize planar cross-cut partitions. We show that the Hilbert function of $\mathcal{S}^{\mathbf{r}}(\Sigma^\mathscr{A})$ is bounded by an expression that involves the dimensions of specific Koszul homology modules constructed from the defining equations of the hyperplane arrangement $\mathscr{A}$ and the smoothness distribution function. By exploiting this connection with Koszul homology, we are able to: 1) compute the dimension of the spline space in high degrees, 2) compute all values of the dimension of the spline space if $\mathscr{A}$ is generic with five or fewer hyperplanes, and 3) compute the Hilbert function of the spline space if $\mathscr{A}$ is a generic arrangement with sufficiently many hyperplanes and ${\mathbf{r}}$ is a constant distribution. As an application of our methods, we compute $\dim \mathcal{S}^0_d(\Sigma^\mathscr{A})$ and $\dim \mathcal{S}^1_d(\Sigma^\mathscr{A})$ for all values of $d$ when $\mathscr{A}$ is a generic arrangement.

math.CO↗

arXiv2026

The van der Waerden Simplicial Complex and its Lefschetz Properties

The van der Waerden simplicial complex, denoted ${\tt vdw}(n,k)$, is the simpicial complex whose facets correspond to the arithmetic progressions of length $k$ in the set $\{1,\ldots,n\}$. We study the Lefschetz properties of the Artinian ring $A({\tt vdw}(n,k)) = K[x_1,\ldots,x_n]/(I_{{\tt vdw}(n,k)} + \langle x_1^2,\ldots,x_n^2\rangle)$ where $I_{{\tt vdw}(n,k)}$ is the associated Stanley--Reisner ideal. If $k=1,2$ or $n-1$, the ring $A({\tt vdw}(n,k))$ will have the Weak Lefschetz Property for all $n > k$. When $k=3$, we classify the rings $A({\tt vdw}(n,3))$ that have the Weak Lefschetz Property when the characteristic is zero. We conjecture that $A({\tt vdw}(n,k))$ fails to have the Weak Lefschetz Property if $n \gg k \geq 3$ and $k$ odd. We also classify when ${\tt vdw}(n,k)$ is a pseudo-manifold, which allows us to show that $A({\tt vdw}(n,k))$ satisfies the Weak Lefschetz Property in some degrees by using a result of Dao and Nair.

math.AC↗

arXiv2025

Splittings of Ideals of Points in $\mathbb{P}^{1}\times\mathbb{P}^{1}$

Let $I_\mathbb{X}$ be the bihomogeneous ideal of a finite set of points $\mathbb{X} \subseteq \mathbb{P}^1 \times \mathbb{P}^1$. The purpose of this note is to consider ``splittings'' of the ideal $I_\mathbb{X}$, that is, finding ideals $J$ and $K$ such that $I_\mathbb{X} = J+K$, where $J$ and $K$ have prescribed algebraic or geometric properties. We show that for any set of points $\mathbb{X}$, we cannot partition the generators of $I_\mathbb{X}$ into two ideals of points. The best case scenario is where at most one of $J$ or $K$ is an ideal of points. To remedy this we introduce the notion of unions of lines and ACM (Arithmetically Cohen-Macaulay) points which allows us to say more about splittings. For a set $\mathbb{W}$ of unions of lines and ACM sets of points, we can write $I_\mathbb{W} = J + K$ where both $J$ and $K$ are ideals of unions of lines and ACM points as well. When $\mathbb{W}$ is a union of lines and ACM points, we discuss some consequences for the graded Betti numbers of $I_{\mathbb{W}}$ in terms of these splittings.

math.AC↗

arXiv2025

Analytic spread of binomial edge ideals

We investigate the analytic spread of binomial edge ideals of finite simple graphs. We provide tight bounds for this invariant in general. For special families of graphs (e.g., closed graphs, pseudo-forests), we compute the exact value for the analytic spread of the corresponding binomial edge ideals via combinatorial and convex geometric means.

math.AC↗

arXiv2025

Comparing the $\mathrm{v}$-number and $h$-polynomials of edge ideals

In this paper, we compare the $\mathrm{v}$-numbers and the degree of the $h$-polynomials associated with edge ideals of connected graphs. We prove that the $\mathrm{v}$-number can be arbitrarily larger or smaller than the degree of the $h$-polynomial for the edge ideal of a connected graph. We also establish that for any pair of positive integers $(v,d)$ with $v \leq d$, there exists a connected graph $H(v,d)$ with the $\mathrm{v}$-number equal to $v$ and the degree of $h$-polynomial equal to $d$. Additionally, we show that the sum of the $\mathrm{v}$-number and the degree of the $h$-polynomial is bounded above by $n$, the number of vertices of $G$, and we classify all graphs for which this sum is exactly $n$. Finally, we show that all thirteen possible inequalities among the three invariants, the $\mathrm{v}$-number, the degree of the $h$-polynomial, and the Castelnuovo-Mumford regularity, can occur in the case of edge ideals of connected graphs. Many of these examples rely on a minimal example of a graph whose $\mathrm{v}$-number is more than the degree of its $h$-polynomial. Using a computer search, we show that there are exactly two such graphs on 11 vertices and 25 edges, and no smaller example on fewer vertices, or 11 vertices and less than 25 edges.

math.AC↗

arXiv2025

Sign patterns which require or allow the strong multiplicity property

We initiate a study of sign patterns that require or allow the non-symmetric strong multiplicity property (nSMP). We show that all cycle patterns require the nSMP, regardless of the number of nonzero diagonal entries. We present a class of Hessenberg patterns that require the nSMP. We characterize which star sign patterns require, which allow, and which do not allow the nSMP. We show that if a pattern requires distinct eigenvalues, then it requires the nSMP. Further, we characterize the patterns that allow the nSMP as being precisely the set of patterns that allow distinct eigenvalues, a property that corresponds to a simple feature of the associated digraph. We also characterize the sign patterns of order at most three according to whether they require, allow, or do not allow the nSMP.

math.RA↗

arXiv2025

The $h$-vectors of toric ideals of odd cycle compositions revisited

Let $G$ be a graph consisting of $s$ odd cycles that all share a common vertex. Bhaskara, Higashitani, and Shibu Deepthi recently computed the $h$-polynomial for the quotient ring $R/I_G$, where $I_G$ is the toric ideal of $G$, in terms of the number and sizes of odd cycles in the graph. The purpose of this note is to prove the stronger result that these toric ideals are geometrically vertex decomposable, which allows us to deduce the result of Bhaskara, Higashitani, and Shibu Deepthi about the $h$-polyhomial as a corollary.

math.AC↗

arXiv2025

Levelable graphs

We study a family of positive weighted well-covered graphs, which we call levelable graphs, that are related to a construction of level artinian rings in commutative algebra. A graph $G$ is levelable if there exists a weight function with positive integer values on the vertices of $G$ such that $G$ is well-covered with respect to this weight function. That is, the sum of the weights in any maximal independent set of vertices of $G$ is the same. We describe some of the basic properties of levelable graphs and classify the levelable graphs for some families of graphs, e.g., trees, cubic circulants, Cameron--Walker graphs. We also explain the connection between levelable graphs and a class of level artinian rings. Applying a result of Brown and Nowakowski about weighted well-covered graphs, we show that for most graphs, their edge ideals are not Cohen--Macaulay.

math.CO↗

arXiv2025

Spheres and balls as independence complexes

The terms "whiskering", and more generally "grafting", refer to adding generators to any monomial ideal to make the resulting ideal Cohen-Macaulay. We investigate the independence complexes of simplicial complexes that are constructed through a whiskering or grafting process, and we show that these independence complexes are (generalized) Bier balls. More specifically, the independence complexes are either homeomorphic to a ball or a sphere. In a related direction, we classify when the independence complexes of very well-covered graphs are homeomorphic to balls or spheres.

math.CO↗

arXiv2025

A classification of van der Waerden complexes with linear resolution

In 2017, Ehrenborg, Govindaiah, Park, and Readdy defined the van der Waerden complex ${\tt vdW}(n,k)$ to be the simplicial complex whose facets correspond to all the arithmetic sequences on the set $\{1,\ldots,n\}$ of a fixed length $k$. To complement a classification of the Cohen--Macaulay van der Waerden complexes obtained by Hooper and Van Tuyl in 2019, a classification of van der Waerden complexes with linear resolution is presented. Furthermore, we show that the Stanley--Reisner ring of a Cohen--Macaulay van der Waerden complex is level.

math.AC↗

arXiv2024

Partial Betti splittings with applications to binomial edge ideals

We introduce the notion of a partial Betti splitting of a homogeneous ideal, generalizing the notion of a Betti splitting first given by Francisco, H\`a, and Van Tuyl. Given a homogeneous ideal $I$ and two ideals $J$ and $K$ such that $I = J+K$, a partial Betti splitting of $I$ relates some of the graded Betti of $I$ with those of $J, K$, and $J\cap K$. As an application, we focus on the partial Betti splittings of binomial edge ideals. Using this new technique, we generalize results of Saeedi Madani and Kiani related to binomial edge ideals with cut edges, we describe a partial Betti splitting for all binomial edge ideals, and we compute the total second Betti number of binomial edge ideals of trees.

math.AC↗

arXiv2024

Simplicial complexes with many facets are vertex decomposable

Suppose $\Delta$ is a pure simplicial complex on $n$ vertices having dimension $d$ and let $c = n-d-1$ be its codimension in the simplex. Terai and Yoshida proved that if the number of facets of $\Delta$ is at least $\binom{n}{c}-2c+1$, then $\Delta$ is Cohen-Macaulay. We improve this result by showing that these hypotheses imply the stronger condition that $\Delta$ is vertex decomposable. We give examples to show that this bound is optimal, and that the conclusion cannot be strengthened to the class of matroids or shifted complexes. We explore an application to Simon's Conjecture and discuss connections to other results from the literature.

math.CO↗

arXiv2023

Conditions for Virtually Cohen--Macaulay Simplicial Complexes

A simplicial complex $\Delta$ is a virtually Cohen-Macaulay simplicial complex if its associated Stanley-Reisner ring $S$ has a virtual resolution, as defined by Berkesch, Erman, and Smith, of length ${\rm codim}(S)$. We provide a sufficient condition on $\Delta$ to be a virtually Cohen-Macaulay simplicial complex. We also introduce virtually shellable simplicial complexes, a generalization of shellable simplicial complexes. Virtually shellable complexes have the property that they are virtually Cohen-Macaulay, generalizing the well-known fact that shellable simplicial complexes are Cohen-Macaulay.

math.AC↗

arXiv2023

Three invariants of geometrically vertex decomposable ideals

We study three invariants of geometrically vertex decomposable ideals: the Castelnuovo-Mumford regularity, the multiplicity, and the $a$-invariant. We show that these invariants can be computed recursively using the ideals that appear in the geometric vertex decomposition process. As an application, we prove that the $a$-invariant of a geometrically vertex decomposable ideal is non-positive. We also recover some previously known results in the literature including a formula for the regularity of the Stanley--Reisner ideal of a pure vertex decomposable simplicial complex, and proofs that some well-known families of ideals are Hilbertian. Finally, we apply our recursions to the study of toric ideals of bipartite graphs. Included among our results on this topic is a new proof for a known bound on the $a$-invariant of a toric ideal of a bipartite graph.

math.AC↗

arXiv2023

Fr\"oberg's Theorem, vertex splittability and higher independence complexes

A celebrated theorem of Fr\"oberg gives a complete combinatorial classification of quadratic square-free monomial ideals with a linear resolution. A generalization of this theorem to higher degree square-free monomial ideals is an active area of research. The existence of a linear resolution of such ideals often depends on the field over which the polynomial ring is defined. Hence, it is too much to expect that in the higher degree case a linear resolution can be identified purely using a combinatorial feature of an associated combinatorial structure. However, some classes of ideals having linear resolutions have been identified using combinatorial structures. In the present paper, we use the notion of $r$-independence to construct an $r$-uniform hypergraph from the given graph. We then show that when the underlying graph is co-chordal, the corresponding edge ideal is vertex splittable, a condition stronger than having a linear resolution. We use this result to explicitly compute graded Betti numbers for various graph classes. Finally, we give a different proof for the existence of a linear resolution using the topological notion of $r$-collapsibility.

math.AC↗

arXiv2023

The weak Lefschetz property of whiskered graphs

We consider Artinian level algebras arising from the whiskering of a graph. Employing a result by Dao-Nair we show that multiplication by a general linear form has maximal rank in degrees 1 and $n-1$ when the characteristic is not two, where $n$ is the number of vertices in the graph. Moreover, the multiplication is injective in degrees $<n/2$ when the characteristic is zero, following a proof by Hausel. Our result in the characteristic zero case is optimal in the sense that there are whiskered graphs for which the multiplication maps in all intermediate degrees $n/2,\ldots,n-2$ of the associated Artinian algebras fail to have maximal rank, and consequently, the weak Lefschetz property.

math.AC↗