Combinatorial results for semigroups of order-decreasing partial transformations

A. Laradji, A. Umar

Research output: Contribution to journalArticle

11 Citations (Scopus)

Abstract

Let PCn be the semigroup of all decreasing and order-preserving partial transformations of a finite chain. It is shown that |PCn| = rn, where rn is the large (or double) Schröder number. Moreover, the total number of idempotents of PCn is shown to be (3n +1)/2.

Original languageEnglish
JournalJournal of Integer Sequences
Volume7
Issue number3
Publication statusPublished - 2004

Keywords

  • Catalan number
  • Fibonacci number
  • Full transformation
  • Narayana numbers
  • Order-decreasing
  • Order-preserving
  • Partial transformation
  • Schröder numbers
  • Semigroup

ASJC Scopus subject areas

  • Discrete Mathematics and Combinatorics

Fingerprint Dive into the research topics of 'Combinatorial results for semigroups of order-decreasing partial transformations'. Together they form a unique fingerprint.

  • Cite this