Nonlinear syzygies in ordinary powers of chordal cover ideals
We construct connected chordal graphs whose cover ideals have ordinary powers that are not componentwise linear over any field, disproving the Herzog--Hibi--Ohsugi conjecture.
arXiv subjects
Publications and source records attributed to Thanh Vu.
We construct connected chordal graphs whose cover ideals have ordinary powers that are not componentwise linear over any field, disproving the Herzog--Hibi--Ohsugi conjecture.
We provide explicit formulas for the Betti numbers of all powers of Ferrers ideals and edge ideals of threshold graphs.
We study graphs whose powers are well-covered, with an emphasis on Cartesian products and Cayley graphs. We first establish necessary conditions and sufficient criteria for Cartesian products, provide examples showing that a factor need not be well-covered and that two noncomplete factors can have the well-covered powers property, and classify several structured product families. In particular, we construct graphs satisfying the well-covered powers property for arbitrarily large diameters. We then show that the Cartesian square of a connected abelian Cayley graph is well-covered exactly when the graph is complete. We classify the well-covered-power graphs among connected circulant graphs of degree at most four. For Cartesian products of any number of complete graphs, we also prove that the recursive alphabet-size inequalities in the final conjecture are sufficient for all powers to be well-covered, prove partial converses for arbitrarily many factors, and give explicit obstructions for every binary prefix followed by one complete factor.
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.
In this paper, we investigate graphs with the property that all of their powers are well-covered. We obtain complete classifications for several graph classes, including chordal graphs, cochordal graphs, and very well-covered graphs.
Let $G$ be a simple graph with cover ideal $J(G)$ in a polynomial ring $S = \k[x_1, \ldots, x_n]$. For each integer $t \ge 1$, let $α_t(G)$ denote the maximum size of an ordered matching $M$ of $G$ with alternating path length $\ell(M) \le 2t - 1$. Hang, Tam, and Vu established that \[ \operatorname{depth}\!\left(S/J(G)^{(t)}\right) \le n - 1 - α_t(G) \] for all $t \ge 1$, where $J(G)^{(t)}$ is the $t$-th symbolic power of $J(G)$. In this paper, we introduce a natural hereditary class of graphs $\mathcal{P}_\k$ for which this inequality holds with equality for every $t \ge 1$. We prove that $\mathcal{P}_\k$ contains all distance-hereditary graphs, and we show that within the class of chordal graphs, $\mathcal{P}_\k$ coincides with the class of distance-hereditary (or gem-free) graphs.
In this paper, we study the ${\rm v}$-number of the symbolic-ordinary discrepancy modules $M_t(I) = I^{(t)} / I^t$ over standard graded Noetherian rings. We show that this coincides with the ${\rm v}$-number of $I^t$ at embedded primes. Moreover, under mild assumptions on $I$, we show that the ${\rm v}$-number of $N_t(I) = I^{(t)} / I^{(t+1)}$ is the same as the ${\rm v}$-number of $I^{(t+1)}$. Furthermore, we provide combinatorial formulas for these ${\rm v}$-numbers when $t = 2, 3$ and $I$ is the edge ideal of a graph. Consequently, we classify all graphs for which ${\rm v}(I^2) = {\rm v}(I^{(2)})$.
We provide a combinatorial description of the stabilization index of the $v$-function of powers of edge ideals for arbitrary graphs.
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.
Let $H$ be a unimodular hypergraph with cover ideal $J(H)$. We prove that the local $v$-numbers of $J(H)^t$ are linear in $t$ for all $t\ge1$. We further show that the global $v$-number of $J(H)^t$ is linear in $t$ for all $t\ge n-1$. Finally, we prove that the global $v$-number of the powers of the cover ideal of any tree is linear in $t$ for all $t\ge1$.
Let $G$ be a simple graph with cover ideal $J(G)$ in a polynomial ring $S$ with $|V(G)|$ variables. We prove that the local $v$-number of the symbolic powers $J(G)^{(t)}$ is linear for all $t \ge 1$ when $G$ is bipartite, and quasi-linear with period two for all $t \ge 2$ when $G$ is non-bipartite. Furthermore, we provide explicit formulas for these invariants in terms of the combinatorial data of $G$.
Let $G$ be a simple graph with cover ideal $J(G)$ in a polynomial ring $S$ in $|V(G)|$ variables. For a matching $M$ of $G$, we denote by $\ell(M)$ the length of the longest $M$-alternating path in $G$. We define $α_t(G)$ to be the maximum size of an ordered matching $M$ of $G$ such that $\ell(M) \le 2t-1$. We then prove that $$\operatorname{depth}(S/J(G)^{(t)}) \le |V(G)| - 1 - α_t(G)$$ for all $t \ge 1$, where $J(G)^{(t)}$ denotes the $t$-th symbolic power of $J(G)$, and that equality holds when $G$ is a forest.
Let $λ= (λ_1, \ldots, λ_n)$ be a partition with $λ_1 = m$. Denote by $J_λ$ the cover ideal in the polynomial ring \( S = k[x_1, \ldots, x_n, y_1, \ldots, y_m] \) associated to the Ferrers graph corresponding to $λ$. Let $d(λ)$ denote the number of distinct parts of $λ$. We prove that \[ \operatorname{pd}(S/J_λ^t) = \min\{t,\; d(λ)\} + 1 \] for all $t \ge 1$.
Accurate medical coding requires consulting authoritative resources such as the ICD tabular list and coding guidelines. Existing LLM-based automated methods largely rely on LLMs' internal knowledge, which is prone to hallucination and cannot keep pace with guideline updates. We introduce RAG-Coding, an agentic, training-free method that augments LLMs with structured external knowledge: the tabular list is encoded as a knowledge graph capturing hierarchical and instructional code relationships, and the guidelines are distilled into concise, code-specific summaries rather than retrieved as raw text. To enable our study, we also introduce MDACE-2025, expert re-annotations of the MDACE dataset under the 2025 ICD-10-CM/PCS guidelines, adding code sequencing and justification comments. On MDACE, RAG-Coding outperforms the best LLM-based baseline by 3--13\% in micro-F1 across five LLM backbones, and achieves comparable micro- and macro-F1 to the supervised state-of-the-art, with higher recall ($+$11\%) at the cost of precision ($-$6\%). On MDACE-2025, RAG-Coding outperforms all baselines, demonstrating effective generalisation to updated guidelines. Ablations confirm stepwise gains, highlighting the importance of integrating structured external knowledge for LLM-based medical coding.
Let $G$ be a simple graph. We demonstrate a method for using $t$-admissible subgraphs of $G$ to determine the regularity of the $t$-th symbolic power of the cover ideal of $G$. As an application, we compute the regularity of powers of cover ideals of bipartite unicyclic graphs.
Let $G$ be a simple graph. We introduce the notion of $t$-admissible subgraphs of $G$ and show how to use them to compute the depth of the $t$-th symbolic powers of the cover ideal of $G$. As an application, we prove that \[ \depth\big(S/J(C_n)^{(t)}\big) = n - 1 - \left\lfloor \frac{tn}{2t+1} \right\rfloor \] for all $t \ge 2$ and $n \ge 3$, where $S = K[x_1,\ldots,x_n]$ and $J(C_n)$ is the cover ideal of the cycle on $n$ vertices.
Let $G$ be a simple connected graph and $t \ge 2$ an integer. We prove that if the maximal homogeneous ideal is an associated prime of the $t$th power of the closed neighborhood ideal of $G$, then the diameter of $G$ is at most $7t - 8$. We further show that this bound is sharp for all $t \ge 2$.
We show that the independence complex of a tree is contractible if and only if it can be reduced to a path \( P_n \) with \( n \equiv 1 \pmod{3} \) by a sequence of truncation moves at branching points. As a consequence of our method, we also characterize the trees for which the independence polynomial evaluated at \( -1 \) is equal to \( 1 \) or \( -1 \).