Finitely generated antisymmetric graph monoids.
Publication:950213
DOI10.1016/j.jalgebra.2008.06.013zbMath1158.16006OpenAlexW2038967576MaRDI QIDQ950213
Francesc Perera, Pere Ara, Friedrich Wehrung
Publication date: 22 October 2008
Published in: Journal of Algebra (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jalgebra.2008.06.013
finitely generated projective modulesquiversLeavitt path algebrasprimely generated monoidsnonstable K-theorygraph monoidsantisymmetric monoidsCuntz-Krieger \(C^*\)-algebras
Commutative semigroups (20M14) Grothendieck groups, (K)-theory, etc. (16E20) Free semigroups, generators and relations, word problems (20M05) (K)-theory and operator algebras (including cyclic theory) (46L80) Representations of quivers and partially ordered sets (16G20) (K_0) as an ordered group, traces (19K14)
Related Items (6)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The regular algebra of a quiver.
- Simple \(C^*\)-algebras generated by isometries
- Separative cancellation for projective modules over exchange rings
- Non-measurability properties of interpolation vector spaces
- Cancellation in primely generated refinement monoids.
- Refinement monoids, Vaught monoids, and Boolean algebras
- The dimension monoid of a lattice
- Nonstable \(K\)-theory for graph algebras.
- The Leavitt path algebra of a graph.
- Flat Semilattices
- A uniform refinement property for congruence lattices
- Bases of countable Boolean algebras
- Semilattices of groups and inductive limits of Cuntz algebras
- Representations of distributive semilattices in ideal lattices of various algebraic structures.
This page was built for publication: Finitely generated antisymmetric graph monoids.
