惯性聚合 高效追踪和阅读你感兴趣的博客、新闻、科技资讯
阅读原文 在惯性聚合中打开

推荐订阅源

V
Visual Studio Blog
Y
Y Combinator Blog
让小产品的独立变现更简单 - ezindie.com
让小产品的独立变现更简单 - ezindie.com
Apple Machine Learning Research
Apple Machine Learning Research
爱范儿
爱范儿
IT之家
IT之家
量子位
小众软件
小众软件
freeCodeCamp Programming Tutorials: Python, JavaScript, Git & More
有赞技术团队
有赞技术团队
罗磊的独立博客
S
SegmentFault 最新的问题
博客园_首页
N
Netflix TechBlog - Medium
月光博客
月光博客
Cyber Security Advisories - MS-ISAC
Cyber Security Advisories - MS-ISAC
aimingoo的专栏
aimingoo的专栏
T
Tailwind CSS Blog
M
MIT News - Artificial intelligence
A
About on SuperTechFans
The Cloudflare Blog
酷 壳 – CoolShell
酷 壳 – CoolShell
腾讯CDC
MyScale Blog
MyScale Blog

math.CO updates on arXiv.org

Complement Submodular Information Measures for Balanced and Robust Data Selection A Proof of a Conjecture on Positive and Negative Square Energies of Unicyclic Graphs Laplacian Spectrum of the Weakly Zero-Divisor Graph of a Finite Commutative Ring An identity for second Eulerian numbers via lattice-point counting $t$-tone edge coloring of graphs Constructing Maximal Bumpless Pipedreams for Double Grothendieck Polynomials Mubayi's Polynomial-Ideal Conjecture and Cover-Ideal Turán Methods Implicit Binarization via Complex Phase Dynamics in Combinatorial Optimization The limits of Schur multipliers in Pólya conversion problems for the $q$-permanent function Universality theorems for generalized splines Framing Triangulations for Arbitrary Integer Flow Polytopes On the Common Generalization of Gentle Algebras and Framed Directed Acyclic Graphs The complexity of frugal digraph homomorphisms Chaotic and periodic behavior of jeu de taquin on infinite Young tableaux Enumerating Pattern Avoiding Parking Functions Incidence toric ideals and three-point functions Unique Winning Opening Move in Three-Row Chomp Strong majority colorings of graphs A Balancing Theorem for Spanning Trees of Rectangular Grid Graphs Spectral radius and edge-disjoint connected factors of graphs New invariants for rank metric codes, with applications to the classification of rank two semifields of order 256 Flexible DP-4-coloring of planar graphs without 4-cycles and intersecting triangles Balanced intersection size distributions in projective planes List Reconstruction Problem with List Size Two Is Dimensionality a Barrier for Retrieval Models? The INIEP: Irreducible and Positive Realizations The number of Pfaffian orientations on punctured polygonally cellulated surfaces Explicit Construction of Polytopes whose Ehrhart Polynomials Realize any Given Sign Pattern Finite-state enumeration of adjacency-constrained 132-avoiding permutations AMDS and quantum AMDS Constacyclic codes of length $4p^ς$ over $\mathbb{F}_{{p}^{m}}$
Explicit Betti Numbers for Skeletons of Chordal Clique Co...
[Submitted on 18 Mar 2026 (v1), last revised 2 Sep 2026 (this ve · 2026-03-18 · via math.CO updates on arXiv.org

View PDF HTML (experimental)

Abstract:Let $\Delta_{\mathbf r}=\Delta_{\mathbf r}(n_1,\ldots,n_e)$ be the clique complex of a chordal graph with maximal cliques $S_1,\ldots,S_e$ in a leaf order, where $n_m=|S_m|$, $r_m=|S_{m+1}\cap(S_1\cup\cdots\cup S_m)|$, $\mathbf r=(r_1,\ldots,r_{e-1})$, and $N_{\mathbf r}$ is the number of vertices. We determine the graded Betti numbers $\beta_{i,j}\bigl(\mathbb K[(\Delta_{\mathbf r})_{(k)}]\bigr)$ of every skeleton and derive explicit formulas for its regularity, projective dimension, depth, multiplicity, Cohen-Macaulayness, and initially Cohen-Macaulayness. We also compute its extremal Betti numbers and describe its integral homology and homotopy type. For the Alexander dual $\Delta_{\mathbf r}^{\vee}$, we construct an explicit minimal multigraded resolution whose shifts are determined by $N_{\mathbf r}-n_m$ and $N_{\mathbf r}-r_m$, and obtain its graded and multigraded Betti numbers, canonical module, Cohen-Macaulay type, $a$-invariant, and Gorenstein criterion. We further show that every proper skeleton $(\Delta_{\mathbf r}^{\vee})_{(k)}$ is Cohen-Macaulay and level, determine its Betti numbers and type, and characterize its Gorenstein cases. Finally, we show that the graded Betti table of $\mathbb K[\Delta_{\mathbf r}^{\vee}]$ determines the multisets ${n_m}$ and ${r_m}$ up to a common shift.

Submission history

From: Mohammed Namiq [view email]
[v1] Wed, 18 Mar 2026 14:39:47 UTC (18 KB)
[v2] Wed, 2 Sep 2026 15:34:19 UTC (24 KB)