SearcharxivSearch

arXiv · 1911.00590

Graph inverse semigroups and Leavitt path algebras

Abstract

We study two classes of inverse semigroups built from directed graphs, namely graph inverse semigroups and a new class of semigroups that we refer to as Leavitt inverse semigroups. These semigroups are closely related to graph $C^*$-algebras and Leavitt path algebras. We provide a topological characterization of the universal groups of the local submonoids of these inverse semigroups. We study the relationship between the graph inverse semigroups of two graphs when there is a directed immersion between the graphs. We describe the structure of graphs that admit a directed cover or directed immersion into a circle and we provide structural information about graph inverse semigroups of finite graphs that admit a directed cover onto a bouquet of circles. We also find necessary and sufficient conditions for a homomorphic image of a graph inverse semigroup to be another graph inverse semigroup. We find a presentation for the Leavitt inverse semigroup of a graph in terms of generators and relations. We describe the structure of the Leavitt inverse semigroup and the Leavitt path algebra of a graph that admits a directed immersion into a circle. We show that two graphs that have isomorphic Leavitt inverse semigroups have isomorphic Leavitt path algebras and we classify graphs that have isomorphic Leavitt inverse semigroups. As a consequence, we show that Leavitt path algebras are $0$-retracts of certain matrix algebras.

Explore related subjects

Keep this discovery

BibTeXRIS

John Meakin, Zhengpan Wang. 2019-11-01. Graph inverse semigroups and Leavitt path algebras. https://arxiv.org/abs/1911.00590

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