On the number of permutations on \(n\) objects with greatest cycle length \(k\)
This paper is concerned with the problem of evaluating \(L_{k,n}\), the number of permutations on \(n\) objects with greatest cycle length \(k\). It is shown that, for \(1<k\leq n\), \[ L_{k,n} =\sum_{j\geq 1} {1\over j!k^j} {n!\over (n-kj)!} \sum_t L_{t,n-kj} \] where, in the inner sum, \(t\leq\min (k-1,n-kj)\). Closed formulae are obtained, e.g. for \({n\over 3} <k<{n \over 2}\). Also discussed are the expected length \(E_n\) of the longest cycle, and the relative expected length \(\lambda_n= {E_n\over n}\) of the largest cycle, which tends to Golomb's constant \(\lambda= 0.62432965 \dots\) as \(n\to\infty\).
scientific article; zbMATH DE number 1143892