The Monoid Of Binary Relations On A Set Of Size Four Has Infinite Representation Type
Representation Theory
2026-04-08 v1
Abstract
The problem of determining the representation type of the full transformation monoid was resolved by Ponizovskii, Putcha, and Ringel. In this paper, we present a similar result for the monoid of binary relations, a partial result for the monoid of -generalized correspondences, and a sufficient condition for a monoid to have infinite representation type.
Cite
@article{arxiv.2604.05121,
title = {The Monoid Of Binary Relations On A Set Of Size Four Has Infinite Representation Type},
author = {Joseph Daynger Ruiz},
journal= {arXiv preprint arXiv:2604.05121},
year = {2026}
}