Papers
Topics
Authors
Recent
Search
2000 character limit reached

Characters and IRS's on branch groups and embeddings into hyperfinite factor

Published 20 Dec 2023 in math.RT | (2312.13124v1)

Abstract: Using the construction by Bencs and T\'{o}th of invariant random subgroups on weakly branch groups acting on regular rooted trees we produce uncountably many indecomposable characters on these groups. In fact, we study three types of characters coming from the action of a weakly branch group on a regular tree, paying attention to their similarities and differences. We use obtained results to show that each countable amenable branch group has uncountably many pairwise not quasi-equivalent embeddings into Murray-von Neumann hyperfinite factor. For the canonical character associated with a self-similar group and studied by the second author as a self-similar trace we provide a number of examples when it is explicitly computed.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.

Tweets

Sign up for free to view the 1 tweet with 0 likes about this paper.