arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1211.5656math.COcs.DMcs.LO
收藏

论群胚与超图

On Groupoids and Hypergraphs

Martin Otto

AI总结:

本文通过构造具有大围长凯莱图的有限群胚,提出一种保持对称性且避免短环的有限超图通用构造方法,可推广至需全局有限闭包的局部粘合构造。

摘要:

我们提出一种有限群胚的新构造,其凯莱图即使在折扣距离度量下也具有大围长;该度量会压缩来自同一颜色类(子群胚)的任意长边序列,只计算颜色类(陪集)之间的转换。这些群胚被用于一种通用的有限超图构造方法,以实现指定的重叠模式并避免小型循环构型。该构造基于由基本局部扩张步骤生成的群胚的约化积,并且可以保持给定重叠模式的对称性。特别地,我们得到了高度对称、无短环的有限超图覆盖。这些群胚及其在约化积中的应用具有足够的通用性,可适用于其他以局部粘合操作指定且需要全局有限闭包的构造。

英文摘要:

We present a novel construction of finite groupoids whose Cayley graphs have large girth even w.r.t. a discounted distance measure that contracts arbitrarily long sequences of edges from the same colour class (sub-groupoid), and only counts transitions between colour classes (cosets). These groupoids are employed towards a generic construction method for finite hypergraphs that realise specified overlap patterns and avoid small cyclic configurations. The constructions are based on reduced products with groupoids generated by the elementary local extension steps, and can be made to preserve the symmetries of the given overlap pattern. In particular, we obtain highly symmetric, finite hypergraph coverings without short cycles. The groupoids and their application in reduced products are sufficiently generic to be applicable to other constructions that are specified in terms of local glueing operations and require global finite closure.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑