Representations and identities of Baxter monoids with involution (Q6145355)

The Baxter monoid \((\mathsf{baxt}_n,^\sharp)\) of rank \(n\) is defined by a free monoid over a finite totally ordered alphabet \(\mathcal{A}_n\) factored by a congruence that is defined by a certain strict binary search trees, where \(^{\sharp}\) is an involution induced by the unique order-reversing permutation on \(\mathcal{A}_n\) (the Schützenberger involution). It is shown that \((\mathsf{baxt}_n,^\sharp)\) admits a faithful representation by an involution monoid of upper triangular matrices over any semiring from a large class including the tropical semiring (\(\mathbb{R}\cup\{-\infty\},\oplus,\otimes\)) under the skew transposition. It turns out that \((\mathsf{baxt}_m,^\sharp)\) and \((\mathsf{baxt}_n,^\sharp)\) generate the same variety for any \(m,n\geq 4\), which is different from the varieties that are generated by \((\mathsf{baxt}_2,^\sharp)\) or \((\mathsf{baxt}_3,^\sharp)\). Necessary and sufficient conditions for word identities satisfied by \((\mathsf{baxt}_n,^\sharp)\) are given and identity bases for \((\mathsf{baxt}_2,^\sharp)\) and for \((\mathsf{baxt}_n,^\sharp)\) for \(n\geq 4\) are derived, both finite. However, \((\mathsf{baxt}_3,^\sharp)\) is not finitely based. It is also proved that the identity checking problem for \((\mathsf{baxt}_n,^\sharp)\) is decidable in polynomial time.