Multi-cluster complexes

Cesar Ceballos, Jean-Philippe Labbé, Christian Stump
{"title":"Multi-cluster complexes","authors":"Cesar Ceballos, Jean-Philippe Labbé, Christian Stump","doi":"10.15488/1672","DOIUrl":null,"url":null,"abstract":"We present a family of simplicial complexes called \\emphmulti-cluster complexes. These complexes generalize the concept of cluster complexes, and extend the notion of multi-associahedra of types ${A}$ and ${B}$ to general finite Coxeter groups. We study combinatorial and geometric properties of these objects and, in particular, provide a simple combinatorial description of the compatibility relation among the set of almost positive roots in the cluster complex.","PeriodicalId":55175,"journal":{"name":"Discrete Mathematics and Theoretical Computer Science","volume":null,"pages":null},"PeriodicalIF":0.7000,"publicationDate":"2012-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Discrete Mathematics and Theoretical Computer Science","FirstCategoryId":"100","ListUrlMain":"https://doi.org/10.15488/1672","RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

We present a family of simplicial complexes called \emphmulti-cluster complexes. These complexes generalize the concept of cluster complexes, and extend the notion of multi-associahedra of types ${A}$ and ${B}$ to general finite Coxeter groups. We study combinatorial and geometric properties of these objects and, in particular, provide a simple combinatorial description of the compatibility relation among the set of almost positive roots in the cluster complex.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
多集群复合物
我们提出了一类简单配合物,称为多簇配合物。这些复形推广了簇复形的概念,并将${A}$和${B}$类型的多共轭体的概念推广到一般有限Coxeter群。我们研究了这些对象的组合性质和几何性质,特别是给出了簇复合体中几乎正根集合间相容关系的一个简单的组合描述。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
14.30%
发文量
39
期刊介绍: DMTCS is a open access scientic journal that is online since 1998. We are member of the Free Journal Network. Sections of DMTCS Analysis of Algorithms Automata, Logic and Semantics Combinatorics Discrete Algorithms Distributed Computing and Networking Graph Theory.
期刊最新文献
Bears with Hats and Independence Polynomials Pseudoperiodic Words and a Question of Shevelev Gossiping with interference in radio ring networks Dissecting power of intersection of two context-free languages Embedding phylogenetic trees in networks of low treewidth
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1