Refinement monoids and adaptable separated graphs
From MaRDI portal
Publication:786007
DOI10.1007/S00233-019-10077-2OpenAlexW2996562421WikidataQ126568580 ScholiaQ126568580MaRDI QIDQ786007FDOQ786007
Authors: Pere Ara, Joan Bosa, Enrique Pardo Espino
Publication date: 12 August 2020
Published in: Semigroup Forum (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1904.04255
Recommendations
Cites Work
- Inverse semigroups and combinatorial \(C^*\)-algebras
- THE REALIZATION PROBLEM FOR VON NEUMANN REGULAR RINGS
- Nonstable \(K\)-theory for graph algebras.
- Title not available (Why is that?)
- Leavitt path algebras
- A groupoid approach to discrete inverse semigroup algebras
- Groupoids, inverse semigroups, and their operator algebras
- Refinement monoids, equidecomposability types, and Boolean inverse semigroups
- Dynamical systems associated to separated graphs, graph algebras, and paradoxical decompositions
- Separative cancellation for projective modules over exchange rings
- Cancellation in primely generated refinement monoids.
- Primely generated refinement monoids
- The regular algebra of a poset
- The structure of countable Boolean algebras
- Primely generated regular refinement monoids
- Finitely generated antisymmetric graph monoids.
- The regular algebra of a quiver.
- Leavitt path algebras of separated graphs
- The Corona factorization property and refinement monoids
- Title not available (Why is that?)
- Representing finitely generated refinement monoids as graph monoids
- The realization problem for finitely generated refinement monoids
- A dichotomy for groupoid \(C^*\)-algebras
Cited In (6)
- The realization problem for finitely generated refinement monoids
- A correspondence between surjective local homeomorphisms and a family of separated graphs
- The groupoids of adaptable separated graphs and their type semigroups
- THE REALIZATION PROBLEM FOR VON NEUMANN REGULAR RINGS
- Refinement monoids and adaptable separated graphs
- Representing finitely generated refinement monoids as graph 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)