Refinement monoids and adaptable separated graphs
From MaRDI portal
Publication:786007
Recommendations
Cites work
- scientific article; zbMATH DE number 42239 (Why is no real title available?)
- scientific article; zbMATH DE number 849292 (Why is no real title available?)
- A dichotomy for groupoid \(C^*\)-algebras
- A groupoid approach to discrete inverse semigroup algebras
- Cancellation in primely generated refinement monoids.
- Dynamical systems associated to separated graphs, graph algebras, and paradoxical decompositions
- Finitely generated antisymmetric graph monoids.
- Groupoids, inverse semigroups, and their operator algebras
- Inverse semigroups and combinatorial \(C^*\)-algebras
- Leavitt path algebras
- Leavitt path algebras of separated graphs
- Nonstable \(K\)-theory for graph algebras.
- Primely generated refinement monoids
- Primely generated regular refinement monoids
- Refinement monoids, equidecomposability types, and Boolean inverse semigroups
- Representing finitely generated refinement monoids as graph monoids
- Separative cancellation for projective modules over exchange rings
- THE REALIZATION PROBLEM FOR VON NEUMANN REGULAR RINGS
- The Corona factorization property and refinement monoids
- The realization problem for finitely generated refinement monoids
- The regular algebra of a poset
- The regular algebra of a quiver.
- The structure of countable Boolean algebras
Cited in
(6)- THE REALIZATION PROBLEM FOR VON NEUMANN REGULAR RINGS
- A correspondence between surjective local homeomorphisms and a family of separated graphs
- The groupoids of adaptable separated graphs and their type semigroups
- Representing finitely generated refinement monoids as graph monoids
- Refinement monoids and adaptable separated graphs
- The realization problem for finitely generated refinement monoids
This page was built for publication: Refinement monoids and adaptable separated graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q786007)