arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv math/0610759math.GRmath.LO
收藏

有限呈现群和快速增长函数的贝蒂数

Betti numbers of finitely presented groups and very rapidly growing functions

Alexander Nabutovsky, Shmuel Weinberger

摘要:

定义群$G$的有限表示的长度为所有关系子的长度之和加上生成元的数目。假设$G$具有长度$\leq N$且$b_k(G)$是有限的,那么$k$的第$b_k(G)=$个Betti数秩$H_k(G)$有多大?我们证明了对于每一个$k\geq 3$的$k$第贝蒂数的最大$b_k(N)$是一个非常迅速增长的功能$N$。它增长得更快,以前在数学中遇到的所有函数(逻辑之外),包括不可计算的函数(至少是那些我们已知的函数)。更正式地说,$b_k$成长为第三个忙碌的海狸函数,它测量具有$\leq N$状态的图灵机的最大生产率,这些状态使用用于图灵机的停机问题的预言,使用用于普通图灵机的停机问题的预言。我们还描述了最快的可能增长的序列的有限贝蒂数的一个群。特别是,它不能像第三个忙碌的海狸函数那样快速增长,但可以比第二个忙碌的海狸函数增长得更快,第二个忙碌的海狸函数使用针对通常图灵机的停机问题的预言来测量图灵机的最大生产率。我们描述了一个自然的问题,贝蒂数的非线性提出的群体,使其答案表示为一个函数的增长作为第五繁忙的海狸功能。此外,我们概述了一个建设的一个共同提出的组,其所有的同源群要么${\bf Z}$或平凡,使其贝蒂数形成一个随机的二进制序列。

英文摘要:

Define the length of a finite presentation of a group $G$ as the sum of lengths of all relators plus the number of generators. How large can be the $k$th Betti number $b_k(G)=$ rank $H_k(G)$ providing that $G$ has length $\leq N$ and $b_k(G)$ is finite? We prove that for every $k\geq 3$ the maximum $b_k(N)$ of $k$th Betti numbers of all such groups is an extremely rapidly growing function of $N$. It grows faster that all functions previously encountered in Mathematics (outside of Logic) including non-computable functions (at least those that are known to us). More formally, $b_k$ grows as the third busy beaver function that measures the maximal productivity of Turing machines with $\leq N$ states that use the oracle for the halting problem of Turing machines using the oracle for the halting problem of usual Turing machines. We also describe the fastest possible growth of a sequence of finite Betti numbers of a finitely presented group. In particular, it cannot grow as fast as the third busy beaver function but can grow faster than the second busy beaver function that measures the maximal productivity of Turing machines using an oracle for the halting problem for usual Turing machines. We describe a natural problem about Betti numbers of finitely presented groups such that its answer is expressed by a function that grows as the fifth busy beaver function. Also, we outline a construction of a finitely presented group all of whose homology groups are either ${\bf Z}$ or trivial such that its Betti numbers form a random binary sequence.

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

↑