Answers are grounded in this paper and cite their sources.
Using Bencs and Tóth’s (2021) construction of invariant random subgroups on weakly branch groups acting on regular rooted trees, we produce uncountably many indecomposable characters on these groups. We study three types of characters, paying attention to their similarities and differences. The obtained results are used to show that each countable amenable weakly branch group has uncountably many pairwise non-quasi-equivalent embeddings into a Murray–von Neumann hyperfinite factor. For the canonical character associated with a self-similar group and studied by Grigorchuk (2011) as a self-similar trace, we provide a number of examples in which it is explicitly computed.
No takes yet. Share an insight, caveat, or question.
Dudko et al. (2026) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: