An automata-based test for bricks over string algebras
Fuente:
arXiv
Enregistré dans:
| Auteurs principaux: | , |
|---|---|
| Format: | Preprint |
| Publié: |
2026
|
| Sujets: | |
| Accès en ligne: | |
| Tags: |
Ajouter un tag
Pas de tags, Soyez le premier à ajouter un tag!
|
| _version_ | 1866915910113034240 |
|---|---|
| author | Kuber, Amit Sengupta, Annoy |
| author_facet | Kuber, Amit Sengupta, Annoy |
| contents | Motivated by the recent work of Deaconu, Mousavand and Paquette on the connection between infinite string bricks for certain gentle algebras and Sturmian words, we develop a decorated version of a deterministic automaton, called a multi-entry inverse automaton (MIA, for short) that accepts pointed words. We then associate an MIA $\mathsf M_{Λδ}$ over $\{0,1\}$ to a string algebra $Λ$, and show that strings over $Λ$ can be viewed as certain equivalence classes of the pointed words accepted by $\mathsf M_{Λδ}$. By defining (weak) brick words over this MIA, we show that a finite/infinite string module (resp. band module) is a brick if and only if every word in the associated equivalence class of pointed binary words is a brick word (resp. a weak brick word) over $\mathsf M_{Λδ}$. The result of Deaconu et al. follows as an immediate consequence. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2603_18820 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | An automata-based test for bricks over string algebras Kuber, Amit Sengupta, Annoy Representation Theory Formal Languages and Automata Theory 16G10, 16G20, 16D80, 68R15, 05A05, 68Q45, 03D05 Motivated by the recent work of Deaconu, Mousavand and Paquette on the connection between infinite string bricks for certain gentle algebras and Sturmian words, we develop a decorated version of a deterministic automaton, called a multi-entry inverse automaton (MIA, for short) that accepts pointed words. We then associate an MIA $\mathsf M_{Λδ}$ over $\{0,1\}$ to a string algebra $Λ$, and show that strings over $Λ$ can be viewed as certain equivalence classes of the pointed words accepted by $\mathsf M_{Λδ}$. By defining (weak) brick words over this MIA, we show that a finite/infinite string module (resp. band module) is a brick if and only if every word in the associated equivalence class of pointed binary words is a brick word (resp. a weak brick word) over $\mathsf M_{Λδ}$. The result of Deaconu et al. follows as an immediate consequence. |
| title | An automata-based test for bricks over string algebras |
| topic | Representation Theory Formal Languages and Automata Theory 16G10, 16G20, 16D80, 68R15, 05A05, 68Q45, 03D05 |
| url | https://arxiv.org/abs/2603.18820 |