Showing 2026Show all
2 papers · 1 filter
math.CO2026
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…
math.RT2026
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…