Some combinatorial properties of the symmetric monoid

A. Laradji, A. Umar

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

Let Tn be the full transformation semigroup of a finite set, say Xn = {1, 2, ..., n}, and for a given full transformation α : Xn → Xn let F(α) = {x ∈ Xn : xα = x} be its set of fixed points. In this note we obtain and discuss formulae for F(n, r, k) = |{α ∈ Tn : |Im α| = r ∧ |F(α)| = k}|.

Original languageEnglish
Pages (from-to)857-865
Number of pages9
JournalInternational Journal of Algebra and Computation
Volume21
Issue number6
DOIs
Publication statusPublished - Sep 2011

Keywords

  • Green's equivalences
  • idempotents
  • semigroups
  • transformations

ASJC Scopus subject areas

  • Mathematics(all)

Fingerprint Dive into the research topics of 'Some combinatorial properties of the symmetric monoid'. Together they form a unique fingerprint.

  • Cite this