Comparability in the graph monoid (Q2214403)

Let \(E\) be a directed graph, and let \(\Gamma\) be an infinite cyclic group with generator \(x\). The authors define a cancellative commutative monoid \(M_E^\Gamma\), endowed with a \(\Gamma\)-action compatible with the monoid structure, and with a natural order \(\leq\). It is showed that for any \(a\in M_E^\Gamma\), exactly one of the following holds: (i) \(x^na\leq a\) for some positive integer \(n\) (in this case \(a\) is called comparable); (ii) \(a\) and \(x^na\) are incomparable for any positive integer \(n\) (in this case \(a\) is called incomparable). Moreover, for any comparable element \(a\), exactly one of the following holds: (i1) \(a=x^na\) for some \(n\) (and then \(a\) is called periodic); (i2) \(x^na<a\) for any \(n\) (in this case \(a\) is called aperiodic). Characterizations of (in)comparable and (a)periodic elements are given in graph theoretic terms. The authors determine all the graphs \(E\) such every element of \(M_E^\Gamma\) is comparable (periodic), the graphs such that every non-zero element is aperiodic (incomparable), the graphs such that no non-zero element is periodic, and the graphs such that no element is aperiodic. The Graded Classification Conjecture is reformulated as follows: the Leavitt path algebras of the graphs \(E\) and \(F\) over a field \(K\) are isomorphic as \(\Gamma\)-graded algebras if and only if \(M_E^\Gamma\) and \(M_F^\Gamma\) are isomorphic as ordered \(\Gamma\)-monoids with order-units. Some results in the direction of a positive answer are presented.