SearcharxivSearch

arXiv · 2605.02889

Gluing diagrams part 1: A constructive solution for the Higman-Thompson group isomorphism problem

Abstract

This paper introduces gluing diagrams a combinatorial tool to construct homomorphisms between the shift pseudogroups of directed graphs and thus also their full groups of shifts. We will establish which of these diagrams produce isomorphisms. As an application, using the interpretation of Higman-Thompson groups as full groups of shifts of specific graphs, we will describe a procedure that constructs gluing diagrams that explicitly describe the isomorphisms between Higman-Thompson groups, conjectured by Higman and whose existence was proven by Pardo arXiv:1006.1759.

Explore related subjects

Keep this discovery

BibTeXRIS

Roman Gorazd. 2026-05-04. Gluing diagrams part 1: A constructive solution for the Higman-Thompson group isomorphism problem. https://arxiv.org/abs/2605.02889

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Reversibility and its asymptotic counting in Picard group

We investigate reversible elements in the Picard modular group $\mathrm{PSL}(2,\mathbb{Z}[i])$. We show that reversibility coincides with strong reversibility for Kleinian groups, in particular for the Picard group. We classify reversible elements in the Picard group and characterize loxodromic reversible elements up to conjugacy. We prove that each such conjugacy class contains exactly eight special representatives. We also obtain asymptotic estimates for the number of reversible conjugacy classes with bounded trace.

math.GR

Conjugator length in finitely generated groups

We describe all functions $\mathbb{N}\rightarrow \mathbb{N}$ that can be realized, up to the standard equivalence, as conjugator length functions of finitely generated groups. Furthermore, we show that any two increasing functions $f,g\colon \mathbb N\to \mathbb N$ can be simultaneously realized as conjugator length functions of finitely generated, commensurable (in particular, quasi-isometric) groups.

math.GR

The spectrum of conjugator length functions

A recent program tries to find which functions appear as conjugator length functions. In this note, we show that any (computable) increasing function larger than $n$ appears as $\mathrm{Cl}_G$ for some finitely generated (recursively presented) group. On the other hand, we demonstrate that either $\mathrm{Cl}_G$ must be constant or $\mathrm{Cl}_G(n)\succ n$. Combining these, we obtain a complete description of which functions appear as conjugator length functions of finitely generated groups.

math.GR