The generating function for total displacement (Q743648): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
Importer (talk | contribs)
Changed an Item
Property / arXiv ID
 
Property / arXiv ID: 1404.4674 / rank
 
Normal rank

Revision as of 16:29, 18 April 2024

scientific article
Language Label Description Also known as
English
The generating function for total displacement
scientific article

    Statements

    The generating function for total displacement (English)
    0 references
    0 references
    0 references
    30 September 2014
    0 references
    Summary: \textit{P. Diaconis} and \textit{R. Graham} [J. R. Stat. Soc., Ser. B 39, 262--268 (1977; Zbl 0375.62045)] studied what Knuth calls the total displacement of a permutation \(w\), which is the sum of the distances \(|w(i)-i|\). In recent work of the first author and Tenner, this statistic appears as twice the type \(A_{n-1}\) version of a statistic for Coxeter groups called the depth of \(w\). There are various enumerative results for this statistic in the work of Diaconis and Graham, codified as exercises in Knuth's textbook, and some other results in the work of Petersen and Tenner. However, no formula for the generating function of this statistic appears in the literature. Knuth comments that ``the generating function for total displacement does not appear to have a simple form''. In this paper, we translate the problem of computing the distribution of total displacement into a problem of counting weighted Motzkin paths. In this way, standard techniques allow us to express the generating function for total displacement as a continued fraction.
    0 references
    permutation statistic
    0 references
    generating function
    0 references
    Motzkin path
    0 references

    Identifiers