Searcharxiv⌕ Search

arXiv subjects

Trung Chau

Publications and source records attributed to Trung Chau.

At least 19 recordsLinked to original sources

Morse resolutions and applications to lcm powers

We consider the $r$-th lcm power $I^{\{r\}}$ of a monomial ideal $I$, defined to be generated by the least common multiples of all $r$-element subsets of the set of minimal monomial generators of $I$. Some homological invariants of these ideals are studied. Specifically, we use discrete Morse theory to give sharp upper bounds for the projective dimension and total Betti numbers of these ideals. Moreover, we completely determine the extent to which lcm powers define the homological shift ideals of edge ideals. Finally, we study when the minimal resolution of some ordinary powers and lcm powers are supported on the same CW-complex.

math.AC↗

Perfect Matching Complexes of $3\times 2n$ Grid Graph

The perfect matching complex of a simple graph $G$ is an abstract simplicial complex whose facets (maximal faces) are precisely the perfect matchings of $G$. In this article, we study the topology of the perfect matching complex of the $3\times 2n$ grid graph and show that it is homotopy equivalent to a wedge of $f_{n-1}$ copies of $(n-1)$-dimensional spheres, where $f_{k}$ denotes the $k$-th Fibonacci number. This proves a particular case of the conjecture given by Chandrakar and Singh for perfect matching complex of grid graphs.

math.CO↗

Associated primes and v-numbers of integral closures of powers of edge ideals

Let $I = I(G)$ be the edge ideal of a finite simple graph $G$. We investigate the relationship between the associated primes and $v$-numbers of powers $I^t$ and their integral closures $\overline{I^t}$. For the third power, we establish the associated prime containment $\operatorname{Ass}(S/\overline{I^3}) \subseteq \operatorname{Ass}(S/I^3)$, which yields $v(I^3) \le v(\overline{I^3})$. In contrast, for $t \ge 4$, we show that $\operatorname{Ass}(S/\overline{I^t})$ and $\operatorname{Ass}(S/I^t)$ are in general incomparable. Furthermore, for every fixed $t \ge 3$ and $r\ge 4$, we construct families of graphs for which the discrepancies $v(\overline{I^t}) - v(I^t)$ and $v(I^r)-v(\overline{I^r})$ are arbitrarily large.

math.AC↗

Realizing resolutions of powers of extremal ideals

Extremal ideals are a class of square-free monomial ideals which dominate and determine many algebraic invariants of powers of all square-free monomial ideals. For example, the $r^{th}$ power ${\mathcal{E}_q}^r$ of the extremal ideal on $q$ generators has the maximum Betti numbers among the $r^{th}$ power of any square-free monomial ideal with $q$ generators. In this paper we study the combinatorial and geometric structure of the (minimal) free resolutions of powers of square-free monomial ideals via the resolutions of powers of extremal ideals. Although the end results are algebraic, this problem has a natural interpretation in terms of polytopes and discrete geometry. Our guiding conjecture is that all powers ${\mathcal{E}_q}^r$ of extremal ideals have resolutions supported on their Scarf simplicial complexes, and thus their resolutions are as small as possible. This conjecture is known to hold for $r \leq 2$ or $q \leq 4$. In this paper we prove the conjecture holds for $r=3$ and any $q\geq 1$ by giving a complete description of the Scarf complex of ${\mathcal{E}_q}^3$. This effectively gives us a sharp bound on the betti numbers and projective dimension of the third power of any square-free momomial ideal. For large $i$ and $q$, our bounds on the $i^{th}$ betti numbers are an exponential improvement over previously known bounds. We also describe a large number of faces of the Scarf complex of ${\mathcal{E}_q}^r$ for any $r,q \geq 1$.

math.AC↗

Weak and strong Lefschetz properties for vertex cover Artinian algebras associated to graphs

Let $G$ be a finite simple graph and let $A_c(G)$ be the Artinian algebra associated with its cover ideal. We prove that $A_c(G)$ has the WLP when $τ(G)>|V(G)|/2$, where $τ(G)$ denotes the size of a minimum vertex cover of $G$. As a consequence, $A_c(G)$ has the WLP with high probability when the Erdős-Rényi random graph model is considered. Moreover, we study the borderline case $τ(G)=|V(G)|/2$ and as a result, classify the WLP for paths, cycles, Ferrers graphs, and well-covered trees.

math.AC↗

Comparing v-numbers of symbolic and ordinary powers of squarefree monomial ideals

Let $I$ be a squarefree monomial ideal, and let $d$ denote the maximum degree of a minimal generator of $I$. We prove that \[ v(I^t)\le v(I^{(t)})+(t-1)(d-1) \] for all $t\ge1$, where $I^{(t)}$ denotes the $t$-th symbolic power of $I$. In particular, this bound does not depend on the number of variables in the ambient polynomial ring. On the other hand, for every fixed exponent $t\ge2$, the difference \[ v(I^{(t)})-v(I^t) \] can be arbitrarily large. Finally, we determine the $v$-numbers of the ordinary and symbolic powers of edge ideals of paths and cycles.

math.AC↗

Extremal behavior of ideals of minors

Let $(R,\mathfrak m,\mathsf k)$ be either a fiber product or an artinian stretched Gorenstein ring, with $\operatorname{ch}(\mathsf k)\neq 2$ in the latter case. We prove that the ideals of minors of the minimal free resolution of any finitely generated $R$-module are eventually 2-periodic. Moreover, if the embedding dimension of $R$ is at least 3, eventually the ideals of minors become the powers of the maximal ideal, yielding the 1-periodicity. These are analogs of results obtained over complete intersections and Golod rings by Brown, Dao, and Sridhar. We also study the transfer of periodicity between rings. Specifically, we prove that for any local ring $(R,\mathfrak m)$, if $x\in \mathfrak m$ is a super-regular element and $M$ is an $R/(x)$ module whose ideals of minors are asymptotically the powers of the maximal ideal over $R/(x)$, then the same holds for the ideals of minors of $M$ over $R$.

math.AC↗

Multiplicity of negative one of independence polynomials of graphs

We initiate the study of the multiplicity of negative one of independence polynomials of graphs. In this article, we simply refer to this as the \emph{multiplicity} of a graph. As applications, we provide a graph-theoretic description of trees whose independence complexes are contractible, give a new sufficient condition for independence polynomials of graphs to be log-concave, and finally, determine possible pairs $(\operatorname{mult}_{-1}P_G, α(G))$, where $P_G$ denotes the independence polynomial of $G$, and $α(G)$ the independence number. The study of the pairs $(\operatorname{mult}_{-1}P_G, α(G))$ is equivalent to finding all pairs of the numerator degree and denominator degree of the Hilbert series of the edge ideal of $G$. We also use spectral graph theory to obtain results on the multiplicity of line graphs of forests. Finally, we give some translations and applications in combinatorial commutative algebra.

math.CO↗

Golod ideals in combinatorial commutative algebra

In this article we study the Golod property of standard graded algebras. We show that determinantal ideals, binomial edge ideals, and permanental ideals are Golod if and only if they have a linear resolution. Next, we give a characterization of when cover ideals define Golod rings, exploiting some considerations on multidegrees of Koszul cycles and Massey products. Finally, we show that squarefree strongly Golod ideals (and, more generally, lcm-strongly Golod ideals) are Golod, and not just weakly Golod.

math.AC↗

The v-numbers of permanental ideals

In this article, we compute the $\vv$-number of $2\times 2$ permanental ideals of generic, generic symmetric, and generic Hankel matrices.

math.AC↗

On Legendrian Thurston-Bennequin-symmetrical graphs

This article reviews the development of Legendrian graph theory in the standard contact 3-sphere ($S^3, ξ_{std}$). We provide a generalized criterion under which the total Thurston-Bennequin invariant of a Legendrian graph (sum of tb of all cycles of the Legendrian graph) can be computed from the tb of its smaller cycles. We verify this criterion for graphs with up to 9 vertices and construct infinite families of examples where it holds. We also present examples demonstrating that each condition in the criterion is necessary. Notably, the graphs satisfying this criterion exhibit a high degree of symmetry.

math.GT↗

On licci squarefree monomial ideals

We study the licci property for several classes of squarefree monomial ideals arising from graphs and related combinatorial structures. We characterize licci bi-Cohen-Macaulay squarefree monomial ideals, complementary edge ideals, $t$-path ideals of cycles, and $(t-1)$-suspensions of graphs. Consequently, the full list of licci path ideals of trees is obtained. This work extends the known classification of licci edge ideals to a broader family of path ideals.

math.AC↗

Realizable (reg, deg h)-Pairs for Cover Ideals via Independence Polynomials

Let $G$ be a finite simple graph on $n$ vertices and set $R=\Bbbk[x_1,\dots,x_n]$, with edge ideal $I(G)$ and cover ideal $J(G)$. We give an explicit description of the $h$-polynomial of $R/J(G)$, in a form that extends to the Alexander dual of any squarefree monomial ideal. We then express $\textrm{deg } h_{R/I(G)}(t)$ and $\textrm{deg } h_{R/J(G)}(t)$ in terms of the independence polynomial $P_G(x)=\sum_{i\ge 0} g_i x^i$ via an invariant $M(G)$, the multiplicity of $x=-1$ as a root of $P_G(x)$. In particular, we prove \[\textrm{deg } h_{R/I(G)}(t)=α(G)-M(G) \qquad\text{and}\qquad \textrm{deg } h_{R/J(G)}(t)=n-2-M(G), \] where $α(G)$ is the independence number of $G$. As a corollary, $M(G)$ is the additive inverse of the $\mathfrak{a}$-invariants of $R/I(G)$ and $R/J(G)$. We develop recursions and closed formulas for $M(G)$ for broad graph families, and use them to analyze which (reg, deg h)-pairs occur for cover ideals within chordal classes, including explicit constructions realizing extremal behavior. We conclude with a conjectural bound on $\left|\textrm{reg }(R/J(G))-\textrm{deg } h_{R/J(G)}(t)\right|$ for connected graphs.

math.AC↗

Symbolic powers and integral closures via extremal ideals

This paper demonstrates that extremal ideals can be used to great effect to compute integral closures of powers and symbolic powers of square-free monomial ideals. We show that the generators of these powers are images of the generators of the corresponding powers of extremal ideals under a specific ring homomorphism. Extremal ideals provide sharp bounds for a variety of invariants widely studied in the literature, including resurgence, asymptotic resurgence, and symbolic defect, as well as Betti numbers of symbolic powers and of integral closures of powers of square-free monomial ideals. When restricted to the class of extremal ideals, algebraic computations are reduced to problems of discrete geometry and linear programming, allowing the use of a wide variety of techniques. As a result, in situations where computations are feasible for extremal ideals, we provide concrete sharp bounds for many of these invariants. Our methods reduce finding homological invariants and algebraic constructions for infinitely many ideals to computations for a single highly symmetric ideal, based solely on the number of generators.

math.AC↗

Edge ideals with linear quotients and without homological linear quotients

A monomial ideal $I$ is said to have homological linear quotients if for each $k\geq 0$, the homological shift ideal $\mathrm{HS}_k(I)$ has linear quotients. It is a well-known fact that if an edge ideal $I(G)$ has homological linear quotients, then $G$ is co-chordal. We construct a family of co-chordal graphs $\{\mathrm{H}_n^c\}_{n\geq 6}$ and propose a conjecture that an edge ideal $I(G)$ has homological linear quotients if and only if $G$ is co-chordal and $\mathrm{H}_n^c$-free for any $n\geq 6$. In this paper, we prove one direction of the conjecture. Moreover, we study possible patterns of pairs $(G,k)$ of a co-chordal graph $G$ and integer $k$ such that $\mathrm{HS}_k(I(G))$ has linear quotients.

math.AC↗

Scarf complexes of connected and path ideals

The $t$-connected ideal of a graph $G$ is generated by all connected induced subgraphs of $G$ with $t$ vertices. When $t = 2$, this coincides with the usual edge ideal of the graph. Following the work of Faridi et al., we give a classification of the graphs whose $t$-connected ideals are minimally resolved by their Scarf complex. We also consider the $t$-path ideal of a graph $G$ which is the ideal generated by all paths of length $t$ in $G$. In this case, we are able to give a classification of the same type for paths of length $t = 4$.

math.AC↗

From neural codes to homological invariants: regularity and projective dimension of polarized neural ideals

Neural codes form an algebraic framework to study the nervous system, and understanding neural codes is a key goal of mathematical neuroscience. Neural rings and ideals are the tools connecting neuroscience and commutative algebra. In this article, we study the projective dimension and (Castelnuovo-Mumford) regularity of polarized neural ideals on $n$ neurons. Particularly, we find all the possible values for these two invariants. Moreover, we characterize when these ideals have linear resolution or linear quotients, assuming that they are generated in degree $n$.

math.AC↗