Related papers: Sch\"utzenberger Products in a Category
We classify the Sch\"utzenberger groups of the category of matrices over the tropical semiring, $M(\mathbb{T})$, in doing so, we obtain a classification for the Sch\"utzenberger groups of the semigroupoid of matrices over the finitary…
We analyse the pseudofinite monadic second order theory of words over a fixed finite alphabet. In particular we present an axiomatisation of this theory, working in a one-sorted first order framework. The analysis hinges on the fact that…
We show that if the Sch\"{u}tzenberger graph of every positive word, that contains an $R$-word only once as it's subword, is finite over an Adain presentation $\langle X|u=v\rangle$, then the Sch\"{u}tzenberger graph of every positive word…
Convergent rewriting systems are well-known tools in the study of the word-rewriting problem. In particular, a presentation of a monoid by a finite convergent rewriting system gives an algorithm to decide the word problem for this monoid.…
One approach to Schubert calculus is to realize Schubert classes as concrete combinatorial objects such as Schubert polynomials. Through an identification of the cohomology ring of the type A full flag variety with the polytope ring of the…
We study the category of left unital graded modules over the Steinberg algebra of a graded ample Hausdorff groupoid. In the first part of the paper, we show that this category is isomorphic to the category of unital left modules over the…
We propose a way of associating to each finitely generated monoid or semigroup a formal language, called its loop problem. In the case of a group, the loop problem is essentially the same as the word problem in the sense of combinatorial…
We combine the language of monoids with the language of preorders so as to refine some fundamental aspects of the classical theory of factorization and prove an abstract factorization theorem with a variety of applications. In particular,…
We develop and explore the idea of recognition of languages (in the general sense of subsets of topological algebras) as preimages of clopen sets under continuous homomorphisms into Stone topological algebras. We obtain an Eilenberg…
We study monoids equipped with a second binary operation that captures the structure of the endomorphisms of an object $X$ such that $X=X\times X$. We construct a universal monoid of this type and examine some of its rich combinatorial…
We construct certain monoids, called tied monoids. These monoids result to be semidirect products finitely presented and commonly built from braid groups and their relatives acting on monoids of set partitions. The nature of our monoids…
The aim of this paper is to solve a problem proposed by Dominique Bourn: to provide a categorical-algebraic characterisation of groups amongst monoids and of rings amongst semirings. In the case of monoids, our solution is given by the…
We introduce the marked Brauer algebra and the marked Brauer category. These generalize the analogous constructions for the ordinary Brauer algebra to the setting of a homogeneous bilinear form on a $\mathbb{Z}_2$-graded vector space. We…
We use language theory to study the rational subset problem for groups and monoids. We show that the decidability of this problem is preserved under graph of groups constructions with finite edge groups. In particular, it passes through…
We study monoidal categories that enjoy a certain weakening of the rigidity property, namely, the existence of a dualizing object in the sense of Grothendieck and Verdier. We call them Grothendieck-Verdier categories. Notable examples…
Building on Retakh's approach to Ext groups through categories of extensions, Schwede reobtained the well-known Gerstenhaber algebra structure on Ext groups over bimodules of associative algebras both from splicing extensions (leading to…
Regular languages -- the languages accepted by deterministic finite automata -- are known to be precisely the languages recognized by finite monoids. This characterization is the origin of algebraic language theory. In this paper, we…
This paper is devoted to the presentation of combinatorial bialgebras whose coproduct is defined with the help of a commutative semigroup. We consider this setting in order to give a general framework which admits as special cases the…
In this paper we introduce novel views of monoids and groups. More specifically, for a given set $S$, let $S^{S\times S}$ be the set of binary operations on $S$. We equip $S^{S\times S}$ with canonical binary operations induced by the…
The use of monoids in the study of word languages recognized by finite-state automata has been quite fruitful. In this work, we look at the same idea of "recognizability by finite monoids" for other monoids. In particular, we attempt to…