Semigroup Forum

, Volume 53, Issue 1, pp 351–368 | Cite as

Catalan monoids, monoids of local endomorphisms, and their presentations

  • Andrew Solomon
Research Article


The Catalan monoid and partial Catalan monoid of a directed graph are introduced. Also introduced is the notion of a local endomorphism of a tree, and it is shown that the Catalan (resp. partial Catalan) monoid of a tree is simply its monoid of extensive local endomorphisms (resp. partial endomorphisms) of finite shift. The main results of this paper are presentations for the Catalan and partial Catalan monoids of a tree. Our presentation for the Catalan monoid of a tree is used to give an alternative proof for a result of Higgins. We also identify results of Aîzenštat and Popova which give presentations for the Catalan monoid and partial Catalan monoid of a finite symmetric chain.


Inductive Hypothesis Directed Graph Elementary Transition Simple Root Finite Semigroup 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    Aîzenštat, A. Ja.,Generating relations of an endomorphism semigroup of a finite linearly ordered set, Sibir. Mat. Z.3 (1962), No. 2, 161–169 (Russian).Google Scholar
  2. [2]
    Cannon, J. and C. Playoust,An Introduction to Magma, School of Mathematics and Statistics, The University of Sydney, 1994.Google Scholar
  3. [3]
    Filippov, N. D.,Graphs and partial groupoids of their directed transformations, Matem. Zapiski Ural. Gos. Univ.,6, (1967), No. 1, 144–156 (Russian).zbMATHGoogle Scholar
  4. [4]
    Gomes, Gracinda M. S. and John M. Howie,On the ranks of certain semigroups of order-preserving transformations, Semigroup, Forum45, (1992), 272–282.zbMATHMathSciNetGoogle Scholar
  5. [5]
    Higgins, Peter M.,Combinatorial results for semigroups of order-preserving mappings, Math. Proc. Camb. Phil. Soc.113, (1993), 281–296.zbMATHMathSciNetCrossRefGoogle Scholar
  6. [6]
    Higgins, Peter M.,Divisors of semigroups of order preserving mappings on a finite chain, Technical Report 94-4, University of Essex (To appear in Int. J. Algebra and Computation).Google Scholar
  7. [7]
    Higgins, Peter, M., “Techniques of Semigroup Theory”, Oxford University Press, 1992.Google Scholar
  8. [8]
    Howie, John M.,The subsemigroups generated by the idempotents of a full transformation semigroup, J. London Math. Soc.41, (1966), 707–716.zbMATHCrossRefMathSciNetGoogle Scholar
  9. [9]
    Howie, John M., “An Introduction to Semigroup Theory”, Academic Press Inc. (London) Ltd., 1976.Google Scholar
  10. [10]
    Howie, John M.,Combinatorial and probabilistic results in transformation semigroups, Words, Languages and Combinatorics 2, 200–206, World Scientific, Singapore, 1994.Google Scholar
  11. [11]
    Mac Lane, S., “Categories for the Working Mathematician” Springer-Verlag New York Inc., 1971.zbMATHGoogle Scholar
  12. [12]
    Molchanov, V. A.,Semigroups of Mappings on Graphs, Semigroup Forum,27 (1983), 155–199.zbMATHCrossRefMathSciNetGoogle Scholar
  13. [13]
    Pin, J.-E., “Varieties of Formal Languages”, North Oxford Academic Publishers Ltd., 1986.Google Scholar
  14. [14]
    Popova, B. V.,Generating relations of a partial endomorphism semigroup of a finite linear ordered set, Uč. Zap. Leningrad. Gos. Ped. Inst.238, (1962), 78–88 (Russian).MathSciNetGoogle Scholar
  15. [15]
    Riordan, J., “Combinatorial Identities”, John Wiley and Sons, Inc., 1968.Google Scholar
  16. [16]
    Solomon, Andrew,Stratifications of the variety of R-trivial monoids, Research Report 94-40, School of Mathematics and Statistics, The University of Sydney.Google Scholar
  17. [17]
    Solomon, Andrew,Monoids of order preserving transformations of a finite chain, Research Report 94-8, School of Mathematics and Statistics, The University of Sydney.Google Scholar
  18. [18]
    Vernitskii, A. S. and M. V. Volkov,A proof and a generalization of Higgins' theorem for semigroups of order-preserving mappings, Technical Report, Department of Mathematics and Mechanics, Ural State University 1994.Google Scholar
  19. [19]
    Walker, T. G.,Semigroup Enumeration—Computer Implementation and Applications, Ph.D. thesis, University of St Andrews, 1992.Google Scholar

Copyright information

© Springer-Verlag New York Inc. 1996

Authors and Affiliations

  • Andrew Solomon
    • 1
  1. 1.School of Mathematics and StatisticsF07, The University of SydneyAustralia

Personalised recommendations