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

推荐订阅源

Microsoft Security Blog
Microsoft Security Blog
Apple Machine Learning Research
Apple Machine Learning Research
美团技术团队
WordPress大学
WordPress大学
酷 壳 – CoolShell
酷 壳 – CoolShell
G
Google Developers Blog
阮一峰的网络日志
阮一峰的网络日志
The Cloudflare Blog
J
Java Code Geeks
Martin Fowler
Martin Fowler
M
MIT News - Artificial intelligence
IT之家
IT之家
博客园 - 三生石上(FineUI控件)
月光博客
月光博客
Google DeepMind News
Google DeepMind News
小众软件
小众软件
V
V2EX
Hugging Face - Blog
Hugging Face - Blog
爱范儿
爱范儿
OSCHINA 社区最新新闻
OSCHINA 社区最新新闻
Jina AI
Jina AI
freeCodeCamp Programming Tutorials: Python, JavaScript, Git & More
腾讯CDC
B
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}}$
Vertex Dismissibility and Scalability of Simplicial Complexe
[Submitted on 11 Mar 2026 (v1), last revised 2 Sep 2026 (this ve · 2026-03-11 · via math.CO updates on arXiv.org

View PDF HTML (experimental)

Abstract:We study three nonpure extensions of vertex decomposability, shellability, and Cohen-Macaulayness at the minimum facet dimension. For $b=\operatorname{indim}\Delta$, strong vertex dismissibility gives a deletion-link recursion on the complex itself in which deletion does not decrease $b$, while vertex dismissibility and scalability require the pure initial skeleton $\Delta^{[b]}$ to be vertex decomposable and shellable, respectively. We prove that a join is strongly vertex dismissible exactly when both factors are strongly vertex dismissible. We also show that strong vertex dismissibility implies that every skeleton $\Delta^k=\Delta^{[k]}$, $k\le b$, is vertex decomposable. When $\operatorname{indim}\Delta\leq1$, weak connectedness is equivalent to vertex dismissibility, scalability, and initially Cohen-Macaulayness over some, equivalently every, field. For quasi-forests, these conditions are also equivalent to strong vertex dismissibility. Our main graph result classifies independence complexes of pseudoforests by showing that strong vertex dismissibility, vertex dismissibility, scalability, and initially Cohen-Macaulayness over some or every field are equivalent and are characterized by a componentwise independent domination criterion. Finally, we connect the combinatorial properties of the pure initial skeleton with algebraic properties of its Alexander dual, focusing on vertex splittability, linear quotients, and linear resolutions in fixed degree.

Submission history

From: Mohammed Namiq [view email]
[v1] Wed, 11 Mar 2026 13:13:17 UTC (14 KB)
[v2] Fri, 3 Apr 2026 12:13:50 UTC (17 KB)
[v3] Wed, 2 Sep 2026 15:42:05 UTC (22 KB)