Irreducible representations of one-sided subshift algebras
Daniel Gon\c{c}alves, Danilo Royer

TL;DR
This paper constructs and analyzes representations of subshift algebras, identifying conditions for faithfulness, irreducibility, and minimal ideals, thereby advancing understanding of their algebraic structure.
Contribution
It introduces criteria for faithfulness and characterizes irreducible components of subshift algebra representations, including minimal left ideals associated with line paths.
Findings
Faithfulness of representation linked to cycles with no exits.
Irreducible components characterized and classified.
Minimal left ideals identified for line paths.
Abstract
Given a subshift over an arbitrary alphabet, we construct a representation of the associated unital algebra. We describe a criteria for the faithfulness of this representation in terms of the existence of cycles with no exits. Subsequently, we focus on describing the irreducible components of this representation and characterize equivalence between such components. Building upon these findings, we identify the minimal left ideals of a subshift algebra associated with (what we call) line paths.
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 · semigroups and automata theory · Algebraic structures and combinatorial models
