Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
173 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

$F$-birestriction monoids in enriched signature (2412.12082v1)

Published 16 Dec 2024 in math.RA and math.GR

Abstract: Motivated by recent interest to $F$-inverse monoids, on the one hand, and to restriction and birestriction monoids, on the other hand, we initiate the study of $F$-birestriction monoids as algebraic structures in the enriched signature $(\cdot, \, *, \,+, \,m,1)$ where the unary operation $m$ maps each element to the maximum element of its $\sigma$-class. We find a presentation of the free $F$-birestriction monoid ${\mathsf{FFBR}}(X)$ as a birestriction monoid ${\mathcal F}$ over the extended set of generators $X\cup\overline{X+}$ where $\overline{X+}$ is a set in a bijection with the free semigroup $X+$ and encodes the maximum elements of (non-projection) $\sigma$-classes. This enables us to show that ${\mathsf{FFBR}}(X)$ decomposes as the partial action product \mbox{$E({\mathcal I})\rtimes X*$} of the idempotent semilattice of the universal inverse monoid ${\mathcal I}$ of ${\mathcal F}$ partially acted upon by the free monoid $X*$. Invoking Sch\"utzenberger graphs, we prove that the word problem for ${\mathsf{FFBR}}(X)$ and its strong and perfect analogues is decidable. Furthermore, we show that ${\mathsf{FFBR}}(X)$ does not admit a geometric model based on a quotient of the Margolis-Meakin expansion $M({\mathsf{FG}}(X), X\cup \overline{X+})$ over the free group ${\mathsf{FG}}(X)$, but the free perfect $X$-generated $F$-birestriction monoid admits such a model.

Summary

We haven't generated a summary for this paper yet.