Associative spectra of graph algebras II. Satisfaction of bracketing identities, spectrum dichotomy
Erkko Lehtonen, Tam\'as Waldhauser

TL;DR
This paper characterizes when a graph algebra satisfies a bracketing identity and reveals that its associative spectrum is either constant or grows exponentially.
Contribution
It provides a necessary and sufficient condition for satisfaction of bracketing identities and establishes a spectrum dichotomy for graph algebras.
Findings
Graph algebras satisfy bracketing identities under specific conditions.
Associative spectrum is either constant or exponentially growing.
Spectrum dichotomy applies to all graph algebras.
Abstract
A necessary and sufficient condition is presented for a graph algebra to satisfy a bracketing identity. The associative spectrum of an arbitrary graph algebra is shown to be either constant or exponentially growing.
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
TopicsAdvanced Topics in Algebra · Matrix Theory and Algorithms · Advanced Operator Algebra Research
