English

The generating function for total displacement

Combinatorics 2014-04-21 v1

Abstract

In a 1977 paper, Diaconis and Graham studied what Knuth calls the total displacement of a permutation ww, which is the sum of the distances w(i)i|w(i)-i|. In recent work of the first author and Tenner, this statistic appears as twice the type An1A_{n-1} version of a statistic for Coxeter groups called the depth of ww. 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.

Cite

@article{arxiv.1404.4674,
  title  = {The generating function for total displacement},
  author = {T. Kyle Petersen and Mathieu Guay-Paquet},
  journal= {arXiv preprint arXiv:1404.4674},
  year   = {2014}
}

Comments

11 pages, 3 tables and many figures

R2 v1 2026-06-22T03:53:25.990Z