Betti numbers of finitely presented groups and very rapidly growing functions

Abstract

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 the k th Betti number b k ( G ) = rank H k ( G ) be providing that G has length ≤ N and b k ( G ) is finite? We prove that for every k ≥ 3 the maximum b k ( N ) of the 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 ≤ 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 Z or trivial such that its Betti numbers form a random binary sequence.