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

iterated wreath productsdepthspseudovarieties of finite semigroupsBrauer type semigroupsKrohn-Rhodes complexityrook Brauer semigroups

Mathematics Subject Classification ID

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

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

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

• scientific article; zbMATH DE number 798167 (Why is no real title available?)
• Cellular algebras
• Equational theories of semigroups with involution.
• 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

(14)

• Equational theories of semigroups with involution.
• scientific article; zbMATH DE number 7551770 (Why is no real title available?)
• Infinite partition monoids.
• Presentation for the partial dual symmetric inverse monoid.
• Identities of the Kauffman Monoid $$\mathcal {K}_4$$ and of the Jones Monoid $$\mathcal {J}_4$$
• Maximal subsemigroups of finite transformation and diagram monoids
• A groupoid approach to regular \(\ast \)-semigroups
• Krohn-Rhodes complexity pseudovarieties are not finitely based
• ON THE KROHN–RHODES COMPLEXITY OF SEMIGROUPS OF UPPER TRIANGULAR MATRICES
• Motzkin monoids and partial Brauer monoids
• Diagram monoids and Graham-Houghton graphs: idempotents and generating sets of ideals
• Enumeration of idempotents in diagram semigroups and algebras
• On groups generated by involutions of a semigroup.
• Identities of the Kauffman monoid \(\mathcal{K}_3\)

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)