arXiv subjects

Michael DiPasquale

Publications and source records attributed to Michael DiPasquale.

At least 19 recordsLinked to original sources

arXiv2026

Asymptotic Resurgence of Facet ideals of Graphic Matroids

Our main results are an upper bound on the asymptotic resurgence of the facet ideal of a graphic matroid in terms of the number of vertices and a lower bound in terms of the circumference. These bounds coincide for Hamiltonian graphs, which form the majority of graphs on $n$ vertices as $n$ tends to infinity. For simple $2$-connected graphs on up to nine vertices, we compute in Sage that the asymptotic resurgence of the facet ideal of a non-Hamiltonian graphic matroid is given either by our upper or lower bound.

math.AC↗

arXiv2026

Asymptotic Resurgence of Facet and Stanley-Reisner ideals of Matroids

Matroid configurations -- introduced by Geramita, Harbourne, Migliore, and Nagel -- are projective varieties which generalize so-called \textit{star configurations} and whose defining ideals are obtained by appropriately specializing the Stanley-Reisner ideal of a matroid. Motivated by this connection, we study the asymptotic resurgence of the Stanley-Reisner ideals of matroids. A result of Villareal shows that it is equivalent to study the asymptotic resurgence of facet ideals. We prove a formula for the asymptotic resurgence of the facet ideal of a matroid in terms of the Waldschmidt constant of facet ideals of the contractions of the matroid. As a consequence, we show that asymptotic resurgence respects the weak order on matroids of the same rank. Therefore, the asymptotic resurgence of the facet ideal of a given matroid is bounded above by the asymptotic resurgence of the facet ideal of a so-called \textit{almost-uniform} matroid of the same rank, which we compute explicitly. Guardo, Harbourne, and Van Tuyl showed that the asymptotic resurgence of an ideal is bounded below by the ratio of the initial degree of the ideal by its Waldschmidt constant. We prove that this lower bound is an equality for facet ideals of many classes of matroids, including matroids of rank $k$ on a ground set of size $n\ge 2k$ whose dual is paving, perfect matroid designs, and sparse paving matroids arising from Steiner systems. For the latter two classes, we explicitly compute the asymptotic resurgence.

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

Generalized Hamming weights and symbolic powers of Stanley-Reisner ideals of matroids

It is well-known that the first generalized Hamming weight of a linear code, more commonly called \textit{the minimum distance} of the linear code, corresponds to the initial degree of the Stanley-Reisner ideal of the matroid of the dual code. Our starting point in this paper is a generalization of this fact -- namely, the $r$-th generalized Hamming weight of a matroid is the smallest degree of a squarefree monomial in the $r$-th symbolic power of the Stanley-Reisner ideal of the matroid (in the appropriate range for $r$). We show that the squarefree monomials in successive symbolic powers of the Stanley-Reisner ideal of a matroid suffice to describe all symbolic powers of the Stanley-Reisner ideal. Hence, we provide explicit expressions for initial degree statistics of symbolic powers of the Stanley-Reisner ideal of a matroid in terms of its generalized Hamming weights. A key aspect of our approach is a careful study of duality. If the generalized Hamming weights of a matroid and its dual are both subadditive, we prove a simple expression for the initial degree of every symbolic power of the Stanley-Reisner ideal of the matroid, which closely mirrors that of a uniform matroid. This has unexpectedly far-reaching consequences - we prove the generalized Hamming weights of a matroid and its dual are both subadditive for many interesting classes of matroids and codes, including sparse paving matroids, perfect matroid designs, matroids arising from Steiner systems, first-order affine and projective Reed-Muller codes, constant weight codes, Griesmer codes, and perfect codes. As an application, we study the resurgence and asymptotic resurgence of the matroid configurations introduced by Geramita-Harbourne-Migliore-Nagel. In particular, we explicitly compute the asymptotic resurgence of a matroid configuration of points arising from a perfect matroid design.

math.AC↗

arXiv2023

Planar splines on a triangulation with a single totally interior edge

We derive an explicit formula, valid for all integers $r,d\ge 0$, for the dimension of the vector space $C^r_d(Δ)$ of piecewise polynomial functions continuously differentiable to order $r$ and whose constituents have degree at most $d$, where $Δ$ is a planar triangulation that has a single totally interior edge. This extends previous results of Tohǎneanu, Mináč, and Sorokina. Our result is a natural successor of Schumaker's 1979 dimension formula for splines on a planar vertex star. Indeed, there has not been a dimension formula in this level of generality (valid for all integers $d,r\ge 0$ and any vertex coordinates) since Schumaker's result. We derive our results using commutative algebra.

math.AC↗

arXiv2023

Geometric aspects of the Jacobian of a hyperplane arrangement

An embedding of the complete bipartite graph $K_{3,3}$ in $\mathbb{P}^2$ gives rise to both a line arrangement and a bar-and-joint framework. For a generic placement of the six vertices, the graded Betti numbers of the logarithmic module of derivations of the line arrangement are constant, but an example due to Ziegler shows that the graded Betti numbers are different when the points lie on a conic. Similarly, in rigidity theory a generic embedding of $K_{3,3}$ in the plane is an infinitesimally rigid bar-and-joint framework, but the framework is infinitesimally flexible when the points lie on a conic. In this paper we develop the theory of weak perspective representations of hyperplane arrangements to formalize and generalize the striking connection between hyperplane arrangements and rigidity theory that this example suggests. In particular, we seek to understand how the interplay of combinatorics and geometry influence algebraic structures associated to an arrangement, such as the saturation of the Jacobian ideal of the arrangement. We make connections between examples and constructions from rigidity theory and interesting phenomena in the study of hyperplane arrangements.

math.AC↗

arXiv2022

Duality for asymptotic invariants of graded families

The starting point of this paper is a duality for sequences of natural numbers which, under mild hypotheses, interchanges subadditive and superadditive sequences and inverts their asymptotic growth constants. We are motivated to explore this sequence duality since it arises naturally in at least two important algebraic-geometric contexts. The first context is Macaulay-Matlis duality, where the sequence of initial degrees of the family of symbolic powers of a radical ideal is dual to the sequence of Castelnuovo-Mumford regularity values of a quotient by ideals generated by powers of linear forms. This philosophy is drawn from an influential paper of Emsalem and Iarrobino. We generalize this duality to differentially closed graded filtrations of ideals. In a different direction, we establish a duality between the sequence of Castelnuovo-Mumford regularity values of the symbolic powers of certain ideals and a geometrically inspired sequence we term the jet separation sequence. We show that this duality underpins the reciprocity between two important geometric invariants: the multipoint Seshadri constant and the asymptotic regularity of a set of points in projective space.

math.AC↗

arXiv2022

Quasi-polynomial growth of numerical and affine semigroups with constrained gaps

A common tool in the theory of numerical semigroups is to interpret a desired class of semigroups as the integer lattice points in a rational polyhedron in order to leverage computational and enumerative techniques from polyhedral geometry. Most arguments of this type make use of a parametrization of numerical semigroups with fixed multiplicity $m$ in terms of their $m$-Apéry sets, giving a representation called Kunz coordinates which obey a collection of inequalities defining the Kunz polyhedron. In this work, we introduce a new class of polyhedra describing numerical semigroups in terms of a truncated addition table of their sporadic elements. Applying a classical theorem of Ehrhart to slices of these polyhedra, we prove that the number of numerical semigroups with $n$ sporadic elements and Frobenius number $f$ is polynomial up to periodicity, or quasi-polynomial, as a function of $f$ for fixed $n$. We also generalize this approach to higher dimensions to demonstrate quasi-polynomial growth of the number of affine semigroups with a fixed number of elements, and all gaps, contained in an integer dilation of a fixed polytope.

math.CO↗

arXiv2020

Koszul multi-Rees algebras of principal $L$-Borel Ideals

Given a monomial $m$ in a polynomial ring and a subset $L$ of the variables of the polynomial ring, the principal $L$-Borel ideal generated by $m$ is the ideal generated by all monomials which can be obtained from $m$ by successively replacing variables of $m$ by those which are in $L$ and have smaller index. Given a collection $\mathcal{I}=\{I_1,\ldots,I_r\}$ where $I_i$ is $L_i$-Borel for $i=1,\ldots,r$ (where the subsets $L_1,\ldots,L_r$ may be different for each ideal), we prove in essence that if the bipartite incidence graph among the subsets $L_1,\ldots,L_r$ is chordal bipartite, then the defining equations of the multi-Rees algebra of $\mathcal{I}$ has a Gröbner basis of quadrics with squarefree lead terms under lexicographic order. Thus the multi-Rees algebra of such a collection of ideals is Koszul, Cohen-Macaulay, and normal. This significantly generalizes a theorem of Ohsugi and Hibi on Koszul bipartite graphs. As a corollary we obtain that the multi-Rees algebra of a collection of principal Borel ideals is Koszul. To prove our main result we use a fiber-wise Gröbner basis criterion for the kernel of a toric map and we introduce a modification of Sturmfels' sorting algorithm.

math.AC↗

arXiv2020

On resurgence via asymptotic resurgence

The resurgence and asymptotic resurgence of an ideal in a polynomial ring are two statistics which measure the relationship between its regular and symbolic powers. We address two aspects of resurgence which can be studied via asymptotic resurgence. First, we show that if an ideal has Noetherian symbolic Rees algebra then its resurgence is rational. Second, we derive two bounds on asymptotic resurgence given a single known containment between a symbolic and regular power. From these bounds we recover and extend criteria for the resurgence of an ideal to be strictly less than its big height recently derived by Grifo, Huneke, and Mukundan. We achieve the reduction to asymptotic resurgence by showing that if the asymptotic resurgence and resurgence are different, then resurgence is a maximum instead of a supremum.

math.AC↗

arXiv2020

A lower bound for the dimension of tetrahedral splines in large degree

We derive a formula which is a lower bound on the dimension of trivariate splines on a tetrahedral partition which are continuously differentiable of order $r$ in large enough degree. While this formula may fail to be a lower bound on the dimension of the spline space in low degree, we illustrate in several examples considered by Alfeld and Schumaker that our formula may give the exact dimension of the spline space in large enough degree if vertex positions are generic. In contrast, for splines continuously differentiable of order $r>1$, every lower bound in the literature diverges (often significantly) in large degree from the dimension of the spline space in these examples. We derive the bound using commutative and homological algebra.

math.NA↗

arXiv2020

A lower bound for splines on tetrahedral vertex stars

A tetrahedral complex all of whose tetrahedra meet at a common vertex is called a \textit{vertex star}. Vertex stars are a natural generalization of planar triangulations, and understanding splines on vertex stars is a crucial step to analyzing trivariate splines. It is particularly difficult to compute the dimension of splines on vertex stars in which the vertex is completely surrounded by tetrahedra -- we call these \textit{closed} vertex stars. A formula due to Alfeld, Neamtu, and Schumaker gives the dimension of $C^r$ splines on closed vertex stars of degree at least $3r+2$. We show that this formula is a lower bound on the dimension of $C^r$ splines of degree at least $(3r+2)/2$. Our proof uses apolarity and the so-called \textit{Waldschmidt constant} of the set of points dual to the interior faces of the vertex star. We also use an argument of Whiteley to show that the only splines of degree at most $(3r+1)/2$ on a generic closed vertex star are global polynomials.

math.CO↗

arXiv2020

The apolar algebra of a product of linear forms

Apolarity is an important tool in commutative algebra and algebraic geometry which studies a form, $f$, by the action of polynomial differential operators on $f$. The quotient of all polynomial differential operators by those which annihilate $f$ is called the apolar algebra of $f$. In general, the apolar algebra of a form is useful for determining its Waring rank, which can be seen as the problem of decomposing the supersymmetric tensor, associated to the form, minimally as a sum of rank one supersymmetric tensors. In this article we study the apolar algebra of a product of linear forms, which generalizes the case of monomials and connects to the geometry of hyperplane arrangements. In the first part of the article we provide a bound on the Waring rank of a product of linear forms under certain genericity assumptions; for this we use the defining equations of so-called star configurations due to Geramita, Harbourne, and Migliore. In the second part of the article we use the computer algebra system Bertini, which operates by homotopy continuation methods, to solve certain rank equations for catalecticant matrices. Our computations suggest that, up to a change of variables, there are exactly six homogeneous polynomials of degree six in three variables which factor completely as a product of linear forms defining an irreducible multi-arrangement and whose apolar algebras have dimension six in degree three. As a consequence of these calculations, we find six cases of such forms with cactus rank six, five of which also have Waring rank six. Among these are products defining subarrangements of the braid and Hessian arrangements.

math.AC↗

arXiv2020

Bivariate Semialgebraic Splines

Semialgebraic splines are bivariate splines over meshes whose edges are arcs of algebraic curves. They were first considered by Wang, Chui, and Stiller. We compute the dimension of the space of semialgebraic splines in two extreme cases. If the polynomials defining the edges span a three-dimensional space of polynomials, then we compute the dimensions from the dimensions for a corresponding rectilinear mesh. If the mesh is sufficiently generic, we give a formula for the dimension of the spline space valid in large degree and bound how large the degree must be for the formula to hold. We also study the dimension of the spline space in examples which do not satisfy either extreme. The results are derived using commutative and homological algebra.

math.AC↗

arXiv2020

Counting the dimension of splines of mixed smoothness: A general recipe, and its application to meshes of arbitrary topologies

In this paper we study the dimension of bivariate polynomial splines of mixed smoothness on polygonal meshes. Here, "mixed smoothness" refers to the choice of different orders of smoothness across different edges of the mesh. To study the dimension of spaces of such splines, we use tools from Homological Algebra. These tools were first applied to the study of splines by Billera (1988). Using them, estimation of the spline space dimension amounts to the study of the generalized Billera-Schenck-Stillman complex for the spline space. In particular, when the homology in positions one and zero of this complex are trivial, the dimension of the spline space can be computed combinatorially. We call such spline spaces "lower-acyclic." In this paper, starting from a spline space which is lower-acyclic, we present sufficient conditions that ensure that the same will be true for the spline space obtained after relaxing the smoothness requirements across a subset of the mesh edges. This general recipe is applied in a specific setting: meshes of arbitrary topologies. We show how our results can be used to compute the dimensions of spline spaces on triangulations, polygonal meshes, and T-meshes with holes.

math.NA↗

arXiv2019

A generalization of Wilf's conjecture for Generalized Numerical Semigroups

A numerical semigroup is a submonoid of $\mathbb N$ with finite complement in $\mathbb N$. A generalized numerical semigroup is a submonoid of $\mathbb{N}^{d}$ with finite complement in $\mathbb{N}^{d}$. In the context of numerical semigroups, Wilf's conjecture is a long standing open problem whose study has led to new mathematics and new ways of thinking about monoids. A natural extension of Wilf's conjecture, to the class of $\mathcal C$-semigroups, was proposed by García-García, Marín-Aragón, and Vigneron-Tenorio. In this paper, we propose a different generalization of Wilf's conjecture, to the setting of generalized numerical semigroups, and prove the conjecture for several large families including the irreducible, symmetric, and monomial case. We also discuss the relationship of our conjecture to the extension proposed by García-García, Marín-Aragón, and Vigneron-Tenorio.

math.CO↗

arXiv2018

Asymptotic resurgence via integral closures

Given an ideal in a polynomial ring, we show that the asymptotic resurgence studied by Guardo, Harbourne, and Van Tuyl can be computed using integral closures. As a consequence, the asymptotic resurgence of an ideal is the maximum of finitely many ratios involving Waldschmidt-like constants (which we call skew Waldschmidt constants) defined in terms of Rees valuations. We use this to prove that the asymptotic resurgence coincides with the resurgence if the ideal is normal (that is, all its powers are integrally closed). For a monomial ideal the skew Waldschmidt constants have an interpretation involving the symbolic polyhedron defined by Cooper, Embree, Hà, and Hoefel. Using this intuition we provide several examples of squarefree monomial ideals whose resurgence and asymptotic resurgence are different.

math.AC↗

arXiv2018

A homological characterization for freeness of multi-arrangements

Building on work of Brandt and Terao in their study of $k$-formality, we introduce a co-chain complex associated to a multi-arrangement and prove that its cohomologies determine freeness of the associated module of multi-derivations. This provides a new homological method for determining freeness of arrangements and multi-arrangements. We work out many applications of this homological method. For instance, we prove that if a multi-arrangement is free then the underlying arrangement is $k$-formal for all $k\ge 2$. We also use this method to completely characterize freeness of certain families of multi-arrangements in moduli, showcasing how the geometry of multi-arrangements with the same intersection lattice may have considerable impact on freeness. New counter-examples to Orlik's conjecture also arise in connection to this latter analysis.

math.AG↗