Logo image
Expected values of statistics on permutation tableaux
Conference proceeding   Open access   Peer reviewed

Expected values of statistics on permutation tableaux

Sylvie Corteel and Pawel Hitczenko
Discrete Mathematics and Theoretical Computer Science, v DMTCS Proceedings vol. AH, 2007 Conference on Analysis of Algorithms (AofA 07)(Proceedings), pp 359-376
01 Jan 2007
url
https://doi.org/10.46298/dmtcs.3518View
Published, Version of Record (VoR) Open

Abstract

Combinatorics Computational Geometry Computer Science Data Structures and Algorithms Discrete Mathematics Mathematics
Permutation tableaux are new objects that were introduced by Postnikov in the context of enumeration of the totally positive Grassmannian cells. They are known to be in bijection with permutations and recently, they have been connected to PASEP model used in statistical physics. Properties of permutation tableaux became a focus of a considerable research activity. In this paper we study properties of basic statistics defined on permutation tableaux. We present a simple and unified approach based on probabilistic techniques and use it to compute the expected values of basic statistics defined on permutation tableaux. We also provide a non―bijective and very simple proof that there are n! permutation tableaux of length n.

Metrics

13 Record Views

Details

Logo image