Some remarks on the combinatorics of \(\mathcal{IS}_n\).
From MaRDI portal
Publication:2571033
DOI10.1007/s00233-004-0158-5zbMath1084.20039OpenAlexW1987449925MaRDI QIDQ2571033
Volodymyr Mazorchuk, Svante Janson
Publication date: 2 November 2005
Published in: Semigroup Forum (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00233-004-0158-5
generating functionsendomorphism semigroupssymmetric inverse semigroupsnumbers of nilpotent elements
Exact enumeration problems, generating functions (05A15) Semigroups of transformations, relations, partitions, etc. (20M20) Asymptotic enumeration (05A16) Inverse semigroups (20M18)
Related Items (4)
Syntactic complexity of prefix-, suffix-, bifix-, and factor-free regular languages ⋮ Unnamed Item ⋮ Fast Fourier transforms for the rook monoid ⋮ Fast Fourier transforms for finite inverse semigroups
This page was built for publication: Some remarks on the combinatorics of \(\mathcal{IS}_n\).