On groups and simplicial complexes

On groups and simplicial complexes
复制标题

关于群和单纯复形

DOI:
10.1016/j.ejc.2018.01.009
复制
发表时间:
2018
影响因子:
1
通讯作者:
Rosenthal, Ron
Rosenthal, Ron
中科院分区:
数学3区
文献类型:
--
作者:
Lubotzky, Alexander;Luria, Zur;Rosenthal, Ron

文献摘要

参考文献

被引文献

相似文献

k正则图的理论与群论密切相关。每个k-正则二部图都是关于群G、一组生成器S(仅依赖于k)和一子群h的Schreier图。本文的目标是开始为一般维数d的k-正则简单复形发展这样一个框架。我们的方法并没有直接推广Schreier图的概念,但仍然提出了一个广泛的k-正则简单复形族作为一个普遍对象的商:k规则的d维树形复合体,它本身是源自一个特定群的简单复合体,仅依赖于d和k。在此过程中,我们回答了Parzanchevski和Rosenthal(2016)关于高维拉普拉斯算子的谱间隙的问题,并证明了Leighton图覆盖定理的高维类比。该方法还提出了k-规则d维复合复合物的随机模型。
The theory of k-regular graphs is closely related to group theory. Every k-regular, bipartite graph is a Schreier graph with respect to some group G, a set of generators S (depending only on k) and a subgroup H. The goal of this paper is to begin to develop such a framework for k-regular simplicial complexes of general dimension d. Our approach does not directly generalize the concept of a Schreier graph, but still presents an extensive family of k-regular simplicial complexes as quotients of one universal object: the k-regular d-dimensional arboreal complex, which is itself a simplicial complex originating in one specific group depending only on d and k. Along the way we answer a question from Parzanchevski and Rosenthal (2016) on the spectral gap of higher dimensional Laplacians and prove a high dimensional analogue of Leighton’s graph covering theorem. This approach also suggests a random model for k-regular d-dimensional multicomplexes.
施赖尔图:传递性和覆盖
DOI: 10.1142/s021819671650003x
发表时间: 2015
期刊: Int. J. Algebra Comput.
影响因子: --
作者:
P. Leemann
通讯作者: P. Leemann
复形、有界上同调和单纯体积的可加性
DOI: 10.4134/bkms.2015.52.6.1855
发表时间: 2001
影响因子: 0.5
作者:
Thilo Kuessner
通讯作者: Thilo Kuessner
拉马努金型复合体
DOI: 10.1007/bf02772543
发表时间: 2005
影响因子: 1
作者:
A. Lubotzky;Beth Samuels;U. Vishne
通讯作者: U. Vishne
图的有限公共覆盖
DOI: 10.1016/0095-8956(82)90042-9
发表时间: 1982
期刊: J. Comb. Theory B
影响因子: --
作者:
F. Leighton
通讯作者: F. Leighton