SOME COMBINATORIAL PROPERTIES OF THE SYMMETRIC MONOID
From MaRDI portal
Publication:3097917
DOI10.1142/S0218196711005954zbMath1229.20068OpenAlexW2168559496MaRDI QIDQ3097917
Abdallah Laradji, Abdullahi Umar
Publication date: 10 November 2011
Published in: International Journal of Algebra and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0218196711005954
idempotentsGreen equivalencessemigroups of transformationsnumbers of fixed pointsfinite symmetric inverse semigroups
Exact enumeration problems, generating functions (05A15) Factorials, binomial coefficients, combinatorial functions (05A10) Semigroups of transformations, relations, partitions, etc. (20M20) Inverse semigroups (20M18)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Classical finite transformation semigroups. An introduction.
- Combinatorial results for semigroups of order-preserving partial transformations.
- Combinatorial results for the symmetric inverse semigroup.
- Combinatorial results for semigroups of order-preserving mappings
- A characterization of idempotents in semigroups