Extending simplicial complexes: Topological and combinatorial properties

IF 0.7 3区 数学 Q2 MATHEMATICS
Mohammad Farrokhi D.G. , Alireza Shamsian , Ali Akbar Yazdan Pour
{"title":"Extending simplicial complexes: Topological and combinatorial properties","authors":"Mohammad Farrokhi D.G. ,&nbsp;Alireza Shamsian ,&nbsp;Ali Akbar Yazdan Pour","doi":"10.1016/j.disc.2024.114335","DOIUrl":null,"url":null,"abstract":"<div><div>Given an arbitrary hypergraph <span><math><mi>H</mi></math></span>, we may glue to <span><math><mi>H</mi></math></span> a family of hypergraphs to get a new hypergraph <span><math><msup><mrow><mi>H</mi></mrow><mrow><mo>′</mo></mrow></msup></math></span> having <span><math><mi>H</mi></math></span> as an induced subhypergraph. In this paper, we introduce three gluing techniques for which the topological and combinatorial properties (such as Cohen-Macaulayness, shellability, vertex-decomposability etc.) of the resulting hypergraph <span><math><msup><mrow><mi>H</mi></mrow><mrow><mo>′</mo></mrow></msup></math></span> is under control in terms of the glued components. This enables us to construct broad classes of simplicial complexes containing a given simplicial complex as induced subcomplex satisfying nice topological and combinatorial properties. Our results will be accompanied with some interesting open problems.</div></div>","PeriodicalId":50572,"journal":{"name":"Discrete Mathematics","volume":"348 3","pages":"Article 114335"},"PeriodicalIF":0.7000,"publicationDate":"2024-11-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Discrete Mathematics","FirstCategoryId":"100","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S0012365X24004667","RegionNum":3,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q2","JCRName":"MATHEMATICS","Score":null,"Total":0}
引用次数: 0

Abstract

Given an arbitrary hypergraph H, we may glue to H a family of hypergraphs to get a new hypergraph H having H as an induced subhypergraph. In this paper, we introduce three gluing techniques for which the topological and combinatorial properties (such as Cohen-Macaulayness, shellability, vertex-decomposability etc.) of the resulting hypergraph H is under control in terms of the glued components. This enables us to construct broad classes of simplicial complexes containing a given simplicial complex as induced subcomplex satisfying nice topological and combinatorial properties. Our results will be accompanied with some interesting open problems.
扩展简单复数:拓扑和组合特性
给定一个任意的超图 H,我们可以将一个超图族粘合到 H 上,从而得到一个以 H 为诱导子超图的新超图 H′。在本文中,我们介绍了三种粘合技术,其拓扑和组合特性(如科恩-马科拉伊性、可脱壳性、顶点可分解性等)都可以通过粘合成分来控制。这使我们能够构造出一大类简单复数,其中包含一个给定简单复数作为诱导子复数,并满足良好的拓扑和组合特性。我们的成果将伴随着一些有趣的开放性问题。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Discrete Mathematics
Discrete Mathematics 数学-数学
CiteScore
1.50
自引率
12.50%
发文量
424
审稿时长
6 months
期刊介绍: Discrete Mathematics provides a common forum for significant research in many areas of discrete mathematics and combinatorics. Among the fields covered by Discrete Mathematics are graph and hypergraph theory, enumeration, coding theory, block designs, the combinatorics of partially ordered sets, extremal set theory, matroid theory, algebraic combinatorics, discrete geometry, matrices, and discrete probability theory. Items in the journal include research articles (Contributions or Notes, depending on length) and survey/expository articles (Perspectives). Efforts are made to process the submission of Notes (short articles) quickly. The Perspectives section features expository articles accessible to a broad audience that cast new light or present unifying points of view on well-known or insufficiently-known topics.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信