Graphs and Bergman's GK gap theorem

DOI10.1006/jabr.1994.1080zbMath0812.16034OpenAlexW1970085300MaRDI QIDQ1322071

Daniel R. Farkas, Harold W. jun. Ellingsen

Publication date: 9 May 1995

Published in: Journal of Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1006/jabr.1994.1080

zbMATH Keywords

free algebraGelfand-Kirillov dimensioncombinatorics of wordsdirected pathconnected componentfree monoidmonomial algebradirected circuitnonrelation words

Mathematics Subject Classification ID

Associative rings determined by universal properties (free algebras, coproducts, adjunction of inverses, etc.) (16S10) Finite rings and finite-dimensional associative algebras (16P10) Finite generation, finite presentability, normal forms (diamond lemma, term-rewriting) (16S15) Growth rate, Gelfand-Kirillov dimension (16P90) Paths and cycles (05C38) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Directed graphs (digraphs), tournaments (05C20)

Related Items (3)

\(C^*\)-algebras, Gelfand-Kirillov dimension, and Følner sets ⋮ A generalized Ufnarovski graph ⋮ Rings that are sums of two locally nilpotent subrings

This page was built for publication: Graphs and Bergman's GK gap theorem