Some combinatorial properties of the symmetric monoid

A. Laradji; A. Umar

doi:10.1142/S0218196711005954

Some combinatorial properties of the symmetric monoid

A. Laradji^*, A. Umar

^*Corresponding author for this work

Mathematics & Statistics

Research output: Contribution to journal › Article › peer-review

2 Citations (Scopus)

Abstract

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

Original language	English
Pages (from-to)	857-865
Number of pages	9
Journal	International Journal of Algebra and Computation
Volume	21
Issue number	6
DOIs	https://doi.org/10.1142/S0218196711005954
Publication status	Published - Sep 2011

Keywords

Green's equivalences
idempotents
semigroups
transformations

ASJC Scopus subject areas

Mathematics(all)

Access to Document

10.1142/S0218196711005954

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

Cite this

@article{9d7cf7d75350420bae3c06314c505749,

title = "Some combinatorial properties of the symmetric monoid",

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}|.",

keywords = "Green's equivalences, idempotents, semigroups, transformations",

author = "A. Laradji and A. Umar",

year = "2011",

month = sep,

doi = "10.1142/S0218196711005954",

language = "English",

volume = "21",

pages = "857--865",

journal = "International Journal of Algebra and Computation",

issn = "0218-1967",

publisher = "World Scientific Publishing Co. Pte Ltd",

number = "6",

}

TY - JOUR

T1 - Some combinatorial properties of the symmetric monoid

AU - Laradji, A.

AU - Umar, A.

PY - 2011/9

Y1 - 2011/9

N2 - 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}|.

AB - 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}|.

KW - Green's equivalences

KW - idempotents

KW - semigroups

KW - transformations

UR - http://www.scopus.com/inward/record.url?scp=80055077895&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=80055077895&partnerID=8YFLogxK

U2 - 10.1142/S0218196711005954

DO - 10.1142/S0218196711005954

M3 - Article

AN - SCOPUS:80055077895

VL - 21

SP - 857

EP - 865

JO - International Journal of Algebra and Computation

JF - International Journal of Algebra and Computation

SN - 0218-1967

IS - 6

ER -

Some combinatorial properties of the symmetric monoid

Abstract

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Cite this