arXiv subjects

Annoy Sengupta

Publications and source records attributed to Annoy Sengupta.

4 recordsLinked to original sources

arXiv2026

An automata-based test for bricks over string algebras

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_{\Lambda\delta}$ over $\{0,1\}$ to a string algebra $\Lambda$, and show that strings over $\Lambda$ can be viewed as certain equivalence classes of the pointed words accepted by $\mathsf M_{\Lambda\delta}$. 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_{\Lambda\delta}$. The result of Deaconu et al. follows as an immediate consequence.

math.RT↗

arXiv2025

Generalised tree modules: Hom-sets and indecomposability

For a zero-relation algebra over a field $\mathcal K$, Crawley-Boevey introduced the concept of a tree module and provided a combinatorial description of a basis for the space of homomorphisms between two tree modules--the basis elements are called graph maps. The indecomposability of tree modules is essentially due to Gabriel. We relax a condition in the definition of a tree module to define generalised tree modules and when $\mathrm{char}(\mathcal K)\neq2$, under a certain condition, provide a combinatorial description of a finite generating set for the space of homomorphisms between two such modules--we call the generators generalised graph maps. As an application, we provide a sufficient condition for the (in)decomposability of certain generalised tree modules. We also show that all indecomposable modules over a Dynkin quiver of type $\mathbf D$ are isomorphic to generalised tree modules--this result also follows from a theorem of Ringel which states that all exceptional modules over the path algebra $\mathcal KQ$ of a finite quiver $Q$ are generalised tree modules.

math.RT↗

arXiv2024

Characterisation of band bricks over certain string algebras and a variant of perfectly clustering words

Generalising a recent work of Dequêne et al. on the connection between perfectly clustering words and band bricks over a particular family of gentle algebras, we characterise band bricks over string algebras whose underlying quiver is acyclic in terms of weakly perfectly clustering pairs of words -- a variant of perfectly clustering words. As a consequence, we characterise band semibricks over all such algebras. Furthermore, the combination of our result and a result of Mousavand and Paquette provides an algorithm to determine whether such a string algebra is brick-infinite.

math.RT↗

arXiv2023

Hammocks for non-domestic string algebras

We show that the order type of the simplest version of a hammock for string algebras lies in the class of finite description linear orders--the smallest class of linear orders containing $\mathbf 0$, $\mathbf 1$, and that is closed under isomorphisms, finite order sum, anti-lexicographic product with $ω$ and $ω^*$, and shuffle of finite subsets--using condensation (localization) of linear orders as a tool. We also introduce two finite subsets of the set of bands and use them to describe the location of left $\mathbb N$-strings in the completion of hammocks.

math.RT↗