Conjecture (GCC). The GCC states that the pointed K0gr -group is a complete invariant of the Leavitt path algebras of finite graphs when these algebras are considered with…
Statement
Conjecture (GCC). The GCC states that the pointed K0gr -group is a complete invariant of the Leavitt path algebras of finite graphs when these algebras are considered with their nat- ural grading by Z. The conjecture has been shown to hold in some special cases including finite graphs such that each cycle has no exits (edges leaving the cycle). We prove that the conjecture holds for graphs with cycles which can have exits – we consider graphs with a composition series such that each composition factor is a cofinal graph with either a unique sink or a unique cycle without exits. This class of graphs coincides with the class of graphs with disjoint cycles, finitely many infinite emitters, sinks and cycles and such that every infinite path ends in a cycle. We say that a graph in this class is a composition S-NE graph (where S stands for sink and NE for no-exits). For the main result, we also require infinite emitters of a graph to emit only countably many edges. In particular, our result holds for finite graphs with disjoint cycles (the Toeplitz graph is such, for example) and we formulate it also for the graph C ∗ -algebras. As a consequence of this result, the Isomorphism Conjecture also holds for the class of graphs we consider. For S-NE graphs we regard, we show that the two conditions from the GCC are equivalent also with a condition expressed only in terms of properties of graphs. In particular, we introduce an invariant we refer to as the S-NE-invariant. Featuring this invariant, our main result does more than prove the GCC for the class of graph we consider – it describes the graded (*-)isomorphism class of a graph from this class. Such description is relevant for the active program of classification of the graph C ∗ -algebras. The S-NE invariant and the methods of our proof indicate that the GCC should generally be considered also with the graph-theoretic condition and that using the length of a composition series for induction is promising when attempting to prove the GCC for other types of graphs. The report passage is retained verbatim as the relevant context for this extracted problem.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.