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

推荐订阅源

WordPress大学
WordPress大学
小众软件
小众软件
MongoDB | Blog
MongoDB | Blog
Hugging Face - Blog
Hugging Face - Blog
Jina AI
Jina AI
Cyber Security Advisories - MS-ISAC
Cyber Security Advisories - MS-ISAC
Stack Overflow Blog
Stack Overflow Blog
L
LangChain Blog
大猫的无限游戏
大猫的无限游戏
量子位
A
About on SuperTechFans
G
Google Developers Blog
雷峰网
雷峰网
奇客Solidot–传递最新科技情报
奇客Solidot–传递最新科技情报
IT之家
IT之家
钛媒体:引领未来商业与生活新知
钛媒体:引领未来商业与生活新知
博客园_首页
H
Hackread – Cybersecurity News, Data Breaches, AI and More
Vercel News
Vercel News
V
Visual Studio Blog
OSCHINA 社区最新新闻
OSCHINA 社区最新新闻
博客园 - 聂微东
U
Unit 42
Apple Machine Learning Research
Apple Machine Learning Research

math updates on arXiv.org

Coupling-Robust Accuracy in Multiphysics Physics Informed Neural Networks via Kronecker-Preconditioned Optimization Non-normal spectral signatures of instability in neural network training dynamics Optimization of randomized neural networks for transfer operator approximation Selective Ambulance Dispatch Under Contextual Travel-Time Uncertainty LLAMA LIMA: A Living Meta-Analysis on the Effects of Generative AI on Learning Mathematics Neural Flow Operators can Approximate any Operator: Abstract Frameworks and Universal Approximations LLMs as Noisy Channels: A Shannon Perspective on Model Capacity and Scaling Laws On the Stability of Spherical Hellinger-Kantorovich Flows and Their Implications for Differential Privacy Training-Free Looped Transformers Move on Muon : A Hamiltonian probability gradient flow perspective of Muon optimizer Entrywise Error Bounds for Spectral Ranking with Semi-Random Adversaries Asymmetric Scaling Laws from Sparse Features Is Dimensionality a Barrier for Retrieval Models? RA-DCA: A Randomized Active-Set DCA for Directional Stationarity in Max-Structured DC Programs Commutator-Induced Uncertainty in VAEs Weisfeiler-Leman Is Incomplete on Simple Spectrum Graphs, so Canonicalize Them Sparse In-Network Learning via Shortest-Path Backpropagation and Finite-Rate Gating Instance-Optimal Estimation with Multiple LLM Judges on a Budget Entropy Equivalence Testing Expand More, Shrink Less: Shaping Effective-Rank Dynamics for Dense Scaling in Recommendation Any-Dimensional Invariant Universality Operationalizing Individual Fairness via Gradient Descent and Bradley-Terry Models Anytime Training with Schedule-Free Spectral Optimization Diffusion-based Denoising Beats Vanilla Score Matching in Parameter Estimation: A Theoretical Explanation Resilience Characterization of AI-Native Wireless Receivers via Persistent Homology The General Theory of Localization Methods Group-Algebraic Tensors: Provably-optimal Equivariant Learning and Physical Symmetry Discovery General Lower Bounds for Differentially Private Federated Learning with Arbitrary Public-Transcript Interactions PilotWiMAE: Pilot-Native Representation Learning for Wireless Channels Proximal basin hopping: global optimization with guarantees
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 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)