Lengths of words in transformation semigroups generated by digraphs

DOI10.1007/s10801-016-0703-9zbMath1355.05116arXiv1602.00935OpenAlexW2255155235WikidataQ59615296 ScholiaQ59615296MaRDI QIDQ510064

Yong-Cai Geng, Sumit K. Garg

Publication date: 16 February 2017

Published in: Journal of Algebraic Combinatorics (Search for Journal in Brave)

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

zbMATH Keywords

transformation semigroupword lengthsimple digraph

Mathematics Subject Classification ID

Semigroups of transformations, relations, partitions, etc. (20M20) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Directed graphs (digraphs), tournaments (05C20)

Related Items (5)

Completely distinguishable automata and the set of synchronizing words ⋮ Inverse monoids of partial graph automorphisms ⋮ A five-element transformation monoid on labelled trees ⋮ Transformation semigroups generated by semicomplete digraphs ⋮ Structural aspects of semigroups based on digraphs

Uses Software

• GAP
• Semigroups

Cites Work

• A classification of the maximal idempotent-generated subsemigroups of finite singular semigroups
• Catalan monoids, monoids of local endomorphisms, and their presentations
• Maximal regular subsemibands of \(\text{Sing}_n\).
• Idempotent generators in finite full transformation semigroups
• ISOMORPHISMS OF TRANSFORMATION SEMIGROUPS ASSOCIATED WITH SIMPLE DIGRAPHS
• The Maximum Number of Strongly Connected Subtournaments^*
• On Subtournaments of a Tournament
• The Subsemigroup Generated By the Idempotents of a Full Transformation Semigroup
• Products of idempotents in finite full transformation semigroups
• Unnamed Item

This page was built for publication: Lengths of words in transformation semigroups generated by digraphs