Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · 2505.16706

The Graded Classification Conjecture holds for graphs with disjoint cycles

Lia Vas
View original source ↗Read source document ↗Export metadata ↓

Abstract

The Graded Classification Conjecture (GCC) states that the pointed $K_0^{\operatorname{gr}}$-group is a complete invariant of the Leavitt path algebras of finite graphs when these algebras are considered with their natural grading by $\mathbb Z.$ The conjecture has previously been shown to hold in some special cases. The main result of the paper shows that the GCC holds for a significantly more general class of graphs included in the class of graphs with disjoint cycles. In particular, our result holds for finite graphs with disjoint cycles. We show the main result also for graph $C^*$-algebras. As a consequence, the graded version of the Isomorphism Conjecture holds for the class of graphs we consider. Besides showing the conjecture for the class of graphs we consider, we realize the Grothendieck $\mathbb Z$-group isomorphism by a specific graded $*$-isomorphism. In particular, we introduce a series of graph operations which preserve the graded $*$-isomorphism class of their algebras. After performing these operations on a graph, we obtain well-behaved ``representative'' graphs, which we call canonical forms. We define an equivalence $\approx$ on graphs such that $E\approx F$ holds when there are isomorphic canonical forms of $E$ and $F$ and we show that the condition $E\approx F$ is equivalent to the existence of an isomorphism $f$ of the Grothendieck $\mathbb Z$-groups of the algebras of $E$ and $F$ in the appropriate category. As $E\approx F$ can be realized by a finite series of specific graph operations, any such isomorphism $f$ can be realized by an explicit graded $*$-algebra isomorphism. Thus, we describe the graded ($*$-)isomorphism classes of the algebras of graphs we consider. Besides the ties to symbolic dynamics and Williams' Problem, such a description is relevant for the active program of classification of graph $C^*$-algebras.

Explore related subjects

math.RAmath.DSmath.OA

Keep this discovery

BibTeXRIS

Lia Vas. 2025-05-22. The Graded Classification Conjecture holds for graphs with disjoint cycles. https://arxiv.org/abs/2505.16706

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Invariants of Nilpotent Lie Algebras via Geometry and Algebra with a Focus on Computation

We consider the problem of computing rational invariants of nilpotent Lie algebras. We compare two methods that are commonly used for this task: the method of integral curves and the Dixmier map. Given a derivation of a rational function field with polynomial coefficients, we formulate a condition under which the kernel can be recovered from a family of rational integral curves, and we show that triangular derivations satisfy this hypothesis. This yields an explicit description of the kernel as a purely transcendental extension and produces algebraically independent generators. We also show that, in the triangular case, the resulting generators agree with those obtained from the Dixmier map via a local slice. A careful analysis of the generating set obtained from this method leads to an algorithm for computing generators of the rational invariant field of a nilpotent Lie algebra. An implementation of the methods is available in the SageMath system.

math.RA↗
arXiv2026

Quasilinear multiplication in the real Cayley--Dickson tower

Direct evaluation of the defining product in the real Cayley--Dickson algebra $A_n$, of dimension $N=2^n$, has quadratic arithmetic complexity. This paper gives a uniform algorithm for multiplication using $O(N\log N)$ real arithmetic operations and $O(N)$ auxiliary storage. The algorithm reduces multiplication to the alternating product on the imaginary subspace, then evaluates that product by a two-call recursion over one fixed quadratic coefficient extension. For $n\ge1$, the resulting bilinear algorithm uses at most $(9n-15)2^{n-1}+10$ input-dependent real multiplications, and for $n\ge3$, the specified arithmetic schedule uses $(34n-83)2^{n-1}+50$ real operations in total. Under this counting convention, the quasilinear schedule uses fewer operations than direct multiplication for $N\ge16$ and than the uniform Cariow--Cariowa method for $N\ge32$. The algorithm is implemented in the MIT-licensed C11 library fastCD, with a NumPy-backed Python interface, and its results are checked against an independent implementation of the defining recursion. In single-core benchmarks against direct multiplication and the uniform Cariow--Cariowa method, the quasilinear implementation had the lowest mean time of the three at every tested dimension $N\ge32$, for both single and batched products, and was roughly $16$ times faster than direct multiplication at $N=1024$.

math.RA↗
arXiv2026

Graded classification of Leavitt path algebras in terms of strong shift equivalence

Given two finite essential adjacency matrices $A$ and $B$, Hazrat's graded classification conjectures posit that an order preserving $\mathbb{Z}[x,x^{-1}]$-module isomorphism of $K_0$ groups implies graded Morita equivalence of the Leavitt path algebras of $A$ and $B$, while the pointed version predicts a graded isomorphism of the Leavitt path algebras when the $K_0$ group isomorphism additionally preserves the class of the regular module. For any field $k$, we show that the Leavitt path algebras over $k$ of $A$ and $B$ are graded Morita equivalent if and only if $A$ and $B$ are strong shift equivalent. By appealing to counterexamples of Kim and Roush from symbolic dynamics, this shows that Hazrat's graded classification conjectures are false.

math.RA↗