Rank gradient, cost of groups and the rank versus Heegaard genus problem (Q713961)

From MaRDI portal
scientific article
Language Label Description Also known as
English
Rank gradient, cost of groups and the rank versus Heegaard genus problem
scientific article

    Statements

    Rank gradient, cost of groups and the rank versus Heegaard genus problem (English)
    0 references
    0 references
    0 references
    0 references
    19 October 2012
    0 references
    The paper under review links two important problems, one in the field of low-dimensional topology and hyperbolic geometry, and one in the field of topological dynamics. The former is known as the Rank vs. Heegard genus Conjecture and asserts that for an orientable, compact \(3\)-dimensional hyperbolic manifold its Heegard genus equals the rank of its fundamental group. The latter problem asks whether every countable group has fixed price, i.e. whether every essentially free measure-preserving Borel action of such a group has the same cost. The core result of the paper (Theorem 2) sounds as follows: either the Rank vs. Heegaard genus conjecture is false or the fixed price problem has a negative solution. Another important result of the paper is a formula (Theorem 1) relating the rank gradient of a Farber chain \((\Gamma_n)\) of subgroups of a finitely generated group \(\Gamma\) with the cost of the action of \(\Gamma\) on the boundary of the coset tree w.r.t. \((\Gamma_n)\). Theorem 1 is one of the main features leading to the core result of the paper. Also Theorem 1 allows the authors to establish the fact that the rank gradient of a Farber chain in any residually finite group with an infinite amenable normal subgroup is zero (Theorem 3).
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    rank gradient
    0 references
    cost
    0 references
    Heegaard genus
    0 references
    fixed price
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references