Pith. sign in

REVIEW 1 cited by

Simplicity of Cuntz-Pimsner algebras of quantum graphs

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2504.00980 v1 pith:OMGYAWKL submitted 2025-04-01 math.OA

classification math.OA
keywords mathcalquantumgraphsalgebracuntz-kriegercuntz-pimsnergraphsimplicity
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

Let $\mathcal{G}$ be a quantum graph without quantum sources and $E_\mathcal{G}$ be the quantum edge correspondence for $\mathcal{G}.$ Our main results include sufficient conditions for simplicity of the Cuntz-Pimsner algebra $\mathcal{O}_{E_\mathcal{G}}$ in terms of $\mathcal{G}$ and for defining a surjection from the quantum Cuntz-Krieger algebra $\mathcal{O}(\mathcal{G})$ onto a particular relative Cuntz-Pimsner algebra for $E_\mathcal{G}$. As an application of these two results, we give the first example of a quantum graph with distinct quantum Cuntz-Krieger and local quantum Cuntz-Krieger algebras. We also characterize simplicity of $\mathcal{O}_{E_\mathcal{G}}$ for some fundamental examples of quantum graphs, including rank-one quantum graphs on a single full matrix algebra, complete quantum graphs, and trivial quantum graphs. Along the way, we provide an equivalent condition for minimality of $E_\mathcal{G}$ and sufficient conditions for aperiodicity of $E_\mathcal{G}$ in terms of the underlying quantum graph $\mathcal{G}$.

Discussion (0). Sign in to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Connectivity for quantum graphs via quantum adjacency operators

    math.OA 2025-05 conditional novelty 6.0 of 10

    A quantum graph is connected exactly when its quantum adjacency operator is irreducible, unifying prior definitions and the Laplacian nullity criterion.

Pith tools