The uniform dimension of a monoid with applications to graph algebras
Luiz Gustavo Cordeiro, Daniel Gon\c{c}alves, Roozbeh Hazrat

TL;DR
This paper extends the concept of uniform dimension from module theory to $ ext{Gamma}$-monoids, applying it to graph algebras to analyze their structure and classify regular ideals, supporting the Graded Classification Conjecture.
Contribution
It introduces the uniform dimension for $ ext{Gamma}$-monoids, connects it to graph algebra structures, and relates regular ideals to graph properties and classification conjectures.
Findings
Uniform dimension measures graph branching complexity.
Orthogonality and regularity notions are developed for $ ext{Gamma}$-monoids.
Results unify studies on regular ideals in Leavitt path and graph $C^*$-algebras.
Abstract
We adapt Goldie's concept of uniform dimensions from module theory over rings to -monoids. A -monoid is said to have uniform dimension if is the largest number of pairwise incomparable nonzero -order ideals contained in . Specializing to the talented monoid of a graph, we show that the uniform dimension provides a rough measure of how the graph branches out. Since for any order ideal , its orthogonal ideal is the largest ideal incomparable to , we study the notions of orthogonality and regularity, particularly when . We show that the freeness of the action of on the talented monoid of a graph is preserved under quotienting by a regular ideal. Furthermore, we determine the underlying hereditary and saturated sets that generate these ideals. These results unify recent studies on regular ideals of the…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsRings, Modules, and Algebras · Commutative Algebra and Its Applications · semigroups and automata theory
