5 papers
Tree Bricks and Finite Tree Automata
Annoy Sengupta
Let be a finite-dimensional zero-relation algebra. We encode Crawley--Boevey tree modules over by finite rooted trees labelled by arrows of and their formal invers…
An automata-based test for bricks over string algebras
Amit Kuber, Annoy Sengupta
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 decora…
Generalised tree modules: Hom-sets and indecomposability
Annoy Sengupta, Amit Kuber
For a zero-relation algebra over a field , Crawley-Boevey introduced the concept of a tree module and provided a combinatorial description of a basis for the space of h…
Characterisation of band bricks over certain string algebras and a variant of perfectly clustering words
Annoy Sengupta, Amit Kuber
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…
Hammocks for non-domestic string algebras
Vinit Sinha, Amit Kuber, Annoy Sengupta +1
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 cont…