AI & Computingarticle2026-08-27

Moves for Bergman Algebras

Open access0 citations

Abstract

We define Bergman presentations and Bergman algebras associated to Bergman presentations. These algebras embrace various generalisations of Leavitt path algebras. A Bergman presentation can be visualised by a Bergman graph, which is a finite bicoloured hypergraph satisfying two conditions. We define several moves for Bergman graphs and prove that they preserve the isomorphism class (resp., the Morita equivalence class) of the corresponding Bergman algebra. The well-known result is recovered that in the context of finite directed graphs the shift move, outsplitting, insplitting, source elimination and collapsing preserve the isomorphism class (resp., the Morita equivalence class) of the corresponding Leavitt path algebra. Moreover, we mention some connections between Tietze transformations and the moves for Bergman graphs defined in this paper.

// Source

View paper (DOI)Open access versionOpenAlexAlgebra ColloquiumPublished 2026-08-27

Authors: Raimund Preusser

Institutions: Nanjing University of Information Science and Technology