多集群复合物

IF 0.7 4区数学

Discrete Mathematics and Theoretical Computer Science Pub Date : 2012-01-01 DOI:10.15488/1672

Cesar Ceballos, Jean-Philippe Labbé, Christian Stump

{"title":"多集群复合物","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":"{\"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}","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

摘要

我们提出了一类简单配合物，称为多簇配合物。这些复形推广了簇复形的概念，并将${A}$和${B}$类型的多共轭体的概念推广到一般有限Coxeter群。我们研究了这些对象的组合性质和几何性质，特别是给出了簇复合体中几乎正根集合间相容关系的一个简单的组合描述。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

查看原文本刊更多论文

Multi-cluster complexes

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.

求助全文

通过发布文献求助，成功后即可免费获取论文全文。去求助

来源期刊

Discrete Mathematics and Theoretical Computer Science 数学-计算机：软件工程

自引率

14.30%

发文量

期刊介绍： 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.