An automata-based test for bricks over string algebras

Abstract

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.

Figures (4)

• Figure 1: $\Lambda_N$ with $\rho=\{a_1b_2,a_2b_3,\cdots,a_{N-2}b_{N-1},b_1a_2,b_2a_3,\cdots,b_{N-2}a_{N-1}\}$
• Figure 2: $\Gamma$ with $\rho=\{a_3bc_1,a_3a_1,c_3c_1\}$
• Figure 3: The underlying automaton of the MIA associated with the algebra in \ref{['exmp: barbell automaton']}
• Figure 4: The underlying automaton of the MIA ${\mathsf M_{\Gamma\delta}}$ used in \ref{['exmp: barbell automaton delta']}

Theorems & Definitions (50)

• Proposition 1.1
• Theorem 1.2
• Theorem 1.3
• Theorem 1.4
• Definition 2.1
• Definition 2.2
• Definition 2.3
• Definition 2.4
• Definition 2.5
• Definition 2.6