Comparability in the graph monoid

zbMATH Open1466.19002arXiv2005.14235MaRDI QIDQ2214403FDOQ2214403

Authors: R. Hazrat, Lia Vaš 

Publication date: 8 December 2020

Published in: The New York Journal of Mathematics (Search for Journal in Brave)

Abstract: Let $Gamma$ be the infinite cyclic group on a generator $x.$ To avoid confusion when working with $mathbbZ$-modules which also have an additional $mathbbZ$-action, we consider the $mathbbZ$-action to be a $Gamma$-action instead. Starting from a directed graph $E$, one can define a cancellative commutative monoid $M_E^{G}amma$ with a $Gamma$-action which agrees with the monoid structure and a natural order. The order and the action enable one to label each nonzero element as being exactly one of the following: comparable (periodic or aperiodic) or incomparable. We comprehensively pair up these element features with the graph-theoretic properties of the generators of the element. We also characterize graphs such that every element of $M_E^{G}amma$ is comparable, periodic, graphs such that every nonzero element of $M_E^{G}amma$ is aperiodic, incomparable, graphs such that no nonzero element of $M_E^{G}amma$ is periodic, and graphs such that no element of $M_E^{G}amma$ is aperiodic. The Graded Classification Conjecture can be formulated to state that $M_E^{G}amma$ is a complete invariant of the Leavitt path algebra $L_K(E)$ of $E$ over a field $K.$ Our characterizations indicate that the Graded Classification Conjecture may have a positive answer since the properties of $E$ are well reflected by the structure of $M_E^{G}amma.$ Our work also implies that some results of [R. Hazrat, H. Li, The talented monoid of a Leavitt path algebra, J. Algebra, 547 (2020) 430-455] hold without requiring the graph to be row-finite.

Full work available at URL: https://arxiv.org/abs/2005.14235

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

Recommendations

• Graphs with disjoint cycles classification via the talented monoid
• The talented monoid of a Leavitt path algebra
• The talented monoid of a directed graph with applications to graph algebras
• Diagonal-preserving ring \(\ast\)-isomorphisms of Leavitt path algebras
• Crossed product Leavitt path algebras
• The graded structure of Leavitt path algebras.
• The \(V\)-monoid of a weighted Leavitt path algebra
• An adjacency matrix perspective of talented monoids and Leavitt path algebras
• Classifying Leavitt path algebras up to involution preserving homotopy
• A talented monoid view on Lie bracket algebras over Leavitt path algebras

zbMATH Keywords

graphgroup actionGrothendieck groupordered abelian groupgraph monoid

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Ordered abelian groups, Riesz groups, ordered linear spaces (06F20) Ordered semigroups and monoids (06F05) Grothendieck groups, (K)-theory, etc. (16E20) Leavitt path algebras (16S88) Algebraic monoids (20M32) (K_0) of other rings (19A49)

Cites Work

• Nonstable \(K\)-theory for graph algebras.
• The classification question for Leavitt path algebras.
• Methods of graded rings.
• The graded Grothendieck group and the classification of Leavitt path algebras.
• Leavitt path algebras
• Graded rings and graded Grothendieck groups
• Uniqueness theorems and ideal structure for Leavitt path algebras
• Adding tails to \(C^*\)-correspondences
• Leavitt path algebras of separated graphs
• Stability of unitary \(\text{SK}_1\) of Azumaya algebras.
• \(K\)-theory classification of graded ultramatricial algebras with involution
• Graded Steinberg algebras and their representations
• The talented monoid of a Leavitt path algebra
• Towards a K-theoretic characterization of graded isomorphisms between Leavitt path algebras
• Graded chain conditions and Leavitt path algebras of no-exit graphs

Cited In (6)

• The functor \(K_0^{\operatorname{gr}}\) is full and only weakly faithful
• The talented monoid of a Leavitt path algebra
• The talented monoid of a directed graph with applications to graph algebras
• Crossed product Leavitt path algebras
• Graphs with disjoint cycles classification via the talented monoid
• An adjacency matrix perspective of talented monoids and Leavitt path algebras

This page was built for publication: Comparability in the graph monoid

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2214403)