arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1001.4472math.GRcs.DMmath.CO
收藏

自由群子群的统计性质

Statistical properties of subgroups of free groups

Frédérique Bassino, Armando Martino, Cyril Nicaud, Enric Ventura, Pascal Weil

摘要:

研究自由群的n-生成子群和群的有限表示的统计性质的通常方法是基于所谓的基于字的分布:子群由随机选择的k-元组生成(确定有限表示),其最大长度允许趋于无穷大。在本文中,我们采用不同的,但同样自然的观点:我们调查的统计特性相同的对象,但关于所谓的基于图形的分布,最近推出的Bassino,Nicaud和Weil。在这里,子群(和有限表示)由随机选择的Stallings图确定,其顶点数趋于无穷大。我们的结果表明,这两个分布的行为相当不同,从对方,脱落一个新的光的性质,可被认为是常见的或罕见的?例如,我们证明了一个自由群的反常子群在基于图的分布中是可以忽略的,而在基于词的分布中是指数通用的。令人惊讶的是,一个随机有限的介绍一般提出了平凡的群体在这个新的分布,而在经典的一个,它是众所周知的一般提出了一个无限的双曲群。

英文摘要:

The usual way to investigate the statistical properties of finitely generated subgroups of free groups, and of finite presentations of groups, is based on the so-called word-based distribution: subgroups are generated (finite presentations are determined) by randomly chosen k-tuples of reduced words, whose maximal length is allowed to tend to infinity. In this paper we adopt a different, though equally natural point of view: we investigate the statistical properties of the same objects, but with respect to the so-called graph-based distribution, recently introduced by Bassino, Nicaud and Weil. Here, subgroups (and finite presentations) are determined by randomly chosen Stallings graphs whose number of vertices tends to infinity. Our results show that these two distributions behave quite differently from each other, shedding a new light on which properties of finitely generated subgroups can be considered frequent or rare. For example, we show that malnormal subgroups of a free group are negligible in the graph-based distribution, while they are exponentially generic in the word-based distribution. Quite surprisingly, a random finite presentation generically presents the trivial group in this new distribution, while in the classical one it is known to generically present an infinite hyperbolic group.

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

↑