Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 54 tok/s
Gemini 2.5 Pro 54 tok/s Pro
GPT-5 Medium 22 tok/s Pro
GPT-5 High 25 tok/s Pro
GPT-4o 99 tok/s Pro
Kimi K2 196 tok/s Pro
GPT OSS 120B 333 tok/s Pro
Claude Sonnet 4.5 34 tok/s Pro
2000 character limit reached

Vertex cover ideals of simplicial complexes (2304.11640v1)

Published 23 Apr 2023 in math.AC and math.CO

Abstract: Given a simplicial complex $\Delta$, we investigate how to construct a new simplicial complex $\bar{\Delta}$ such that the corresponding monomial ideals satisfy nice algebraic properties. We give a procedure to check the vertex decomposability of an arbitrary hypergraph. As a consequence, we prove that attaching non-pure skeletons at all vertices of a cycle cover of a simplicial complex $\Delta$ results in a simplicial complex $\bar{\Delta}$ such that the associated hypergraph $\mathcal{H}(\bar{\Delta})$ is vertex decomposable. Also, we prove that all symbolic powers of the cover ideal of $\bar{\Delta}$ are componentwise linear. Our work generalizes the earlier known result where non-pure complete graphs were added to all vertices of a cycle cover of a graph.

Summary

We haven't generated a summary for this paper yet.

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (2)

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.