Krohn-Rhodes complexity of Brauer type semigroups.

DOI10.4171/PM/1921MaRDI QIDQ1941297zbMATH OpenFDO

Authors K. Auinger

Publication date 12 March 2013

Published in Portugaliae Mathematica. Nova Série (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1202.4982

zbMATH Keywords

Brauer type semigroupsdepthsiterated wreath productsKrohn-Rhodes complexitypseudovarieties of finite semigroupsrook Brauer semigroups

Mathematics Subject Classification ID

Varieties and pseudovarieties of semigroups (20M07) Regular semigroups (20M17) Semigroups of transformations, relations, partitions, etc. (20M20)

Abstract: The Krohn--Rhodes complexity of the Brauer semigroup $mathfrak{B}_n$ and of the annular semigroup $mathfrak{A}_n$ is computed.

Review text

The Krohn-Rhodes complexity of a finite semigroup \(S\) is the minimal number of factors of the form \(A_i\wr G_i\), where \(A_i\) is aperiodic and \(G_i\) is a group, such that \(S\) divides an iterated wreath product composed of these factors. A ``Brauer type semigroup is, informally speaking, a ``natural subsemigroup of the Jones-Martin semigroup of all partition diagrams. In the paper under review the author determines the Krohn-Rhodes complexity for many Brauer type semigroups, including the classical Brauer semigroup, the partial version of the Brauer semigroup and the annular semigroup. In most cases the results is ``as expected, that is the Krohn-Rhodes complexity is given by the essential \(\mathcal J\)-depth of the respective semigroup. The exception is the annular semigroup of even degree in which case the complexity is the \(\mathcal J\)-depth minus one.

Recommendations

• ON THE KROHN–RHODES COMPLEXITY OF SEMIGROUPS OF UPPER TRIANGULAR MATRICES
• scientific article; zbMATH DE number 1419247
• Subsemigroups and complexity via the presentation lemma
• COMPLEXITY PSEUDOVARIETIES ARE NOT LOCAL: TYPE II SUBSEMIGROUPS CAN FALL ARBITRARILY IN COMPLEXITY
• An effective lower bound for group complexity of finite semigroups and automata

Cites work

• Cellular algebras
• Equational theories of semigroups with involution.
• scientific article; zbMATH DE number 798167 (Why is no real title available?)
• INEVITABLE GRAPHS: A PROOF OF THE TYPE II CONJECTURE AND SOME RELATED DECISION PROCEDURES
• Kauffman Monoids
• On algebras which are connected with the semisimple continuous groups
• Pseudovarieties generated by Brauer type monoids.

Cited in

(16)

• Maximal subsemigroups of finite transformation and diagram monoids
• Subsemigroups and complexity via the presentation lemma
• Equational theories of semigroups with involution.
• Infinite partition monoids.
• Motzkin monoids and partial Brauer monoids
• Diagram monoids and Graham-Houghton graphs: idempotents and generating sets of ideals
• Krohn-Rhodes complexity pseudovarieties are not finitely based
• Enumeration of idempotents in diagram semigroups and algebras
• Identities of the Kauffman Monoid $$\mathcal {K}_4$$ and of the Jones Monoid $$\mathcal {J}_4$$
• Congruences on infinite partition and partial Brauer monoids
• Identities of the Kauffman monoid \(\mathcal{K}_3\)
• Presentation for the partial dual symmetric inverse monoid.
• ON THE KROHN–RHODES COMPLEXITY OF SEMIGROUPS OF UPPER TRIANGULAR MATRICES
• A groupoid approach to regular -semigroups
• Presentations for semigroups of full-domain partitions
• On groups generated by involutions of a semigroup.

This page was built for publication: Krohn-Rhodes complexity of Brauer type semigroups.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1941297)