Some remarks on the combinatorics of \(\mathcal{IS}_n\). (Q2571033)

This paper is replete with proven results on asymptotics on \(IS_n\), the authors' notation for the symmetric inverse semigroup, and its endomorphism monoid \(\text{End}(IS_n)\). The ratio of the cardinals of the former over the latter, tends to zero (although stated upside-down in the abstract). Some asymptotic results are quite complicated, featuring many familiar terms from combinatorics, while some turn out to be simple: the order of \(\text{End}(IS_n)\) is asymptotically \(3n!\) while the ratio of \(IS_{n+1}/IS_n\) is asymptotically equal to \(n\). The cycle number of a randomly selected member of \(IS_n\) is ``almost Poisson distributed'' with mean \(\tfrac12\ell n\,n\), and there are many more results along these lines.