Graded isomorphisms of Leavitt path algebras and Leavitt inverse semigroups

Fuente: arXiv
Saved in:
Bibliographic Details
Main Authors: Li, Huanhuan, Li, Zongchao, Wang, Zhengpan
Format: Preprint
Published: 2024
Subjects:
Online Access:
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866929627085144064
author Li, Huanhuan
Li, Zongchao
Wang, Zhengpan
author_facet Li, Huanhuan
Li, Zongchao
Wang, Zhengpan
contents Leavitt inverse semigroups of directed finite graphs are related to Leavitt graph algebras of (directed) graphs. Leavitt path algebras of graphs have the natural $\mathbb Z$-grading via the length of paths in graphs. We consider the $\mathbb Z$-grading on Leavitt inverse semigroups. For connected finite graphs having vertices out-degree at most $1$, we give a combinatorial sufficient and necessary condition on graphs to classify the corresponding Leavitt path algebras and Leavitt inverse semigroups up to graded isomorphisms. More precisely, the combinatorial condition on two graphs coincides if and only if the Leavitt path algebras of the two graphs are $\mathbb Z$-graded isomorphic if and only if the Leavitt inverse semigroups of the two graphs are $\mathbb Z$-graded isomorphic.
format Preprint
id arxiv_https___arxiv_org_abs_2412_08919
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Graded isomorphisms of Leavitt path algebras and Leavitt inverse semigroups
Li, Huanhuan
Li, Zongchao
Wang, Zhengpan
Rings and Algebras
20M18, 16S88
Leavitt inverse semigroups of directed finite graphs are related to Leavitt graph algebras of (directed) graphs. Leavitt path algebras of graphs have the natural $\mathbb Z$-grading via the length of paths in graphs. We consider the $\mathbb Z$-grading on Leavitt inverse semigroups. For connected finite graphs having vertices out-degree at most $1$, we give a combinatorial sufficient and necessary condition on graphs to classify the corresponding Leavitt path algebras and Leavitt inverse semigroups up to graded isomorphisms. More precisely, the combinatorial condition on two graphs coincides if and only if the Leavitt path algebras of the two graphs are $\mathbb Z$-graded isomorphic if and only if the Leavitt inverse semigroups of the two graphs are $\mathbb Z$-graded isomorphic.
title Graded isomorphisms of Leavitt path algebras and Leavitt inverse semigroups
topic Rings and Algebras
20M18, 16S88
url https://arxiv.org/abs/2412.08919