Distribution of the number of corners in tree-like and permutation tableaux
From MaRDI portal
Abstract: In this paper, we study tree--like tableaux and some of their probabilistic properties. Tree--like tableaux are in bijection with other combinatorial structures, including permutation tableaux, and have a connection to the partially asymmetric simple exclusion process (PASEP), an important model of an interacting particles system. In particular, in the context of tree-like tableaux, a corner corresponds to a node occupied by a particle that could jump to the right while inner corners indicate a particle with an empty node to its left. Thus, the total number of corners represents the number of nodes at which PASEP can move, i. e. the total current activity of the system. As the number of inner corners and regular corners is connected, we limit our discussion to just regular corners and show that asymptotically, the number of corners in a tableau of length is normally distributed.
Recommendations
Cites work
- Asymptotic normality of statistics on permutation tableaux
- Bijections for permutation tableaux
- Corners in tree-like tableaux
- Enumeration of corners in tree-like tableaux
- Exact solution of a 1D asymmetric exclusion model using a matrix formulation
- Expected values of statistics on permutation tableaux
- scientific article; zbMATH DE number 765034 (Why is no real title available?)
- Occupied corners in tree-like tableaux
- On some properties of permutation tableaux
- Permutation tableaux and permutation patterns
- Tableaux combinatorics for the asymmetric exclusion process
- Tree-like tableaux
This page was built for publication: Distribution of the number of corners in tree-like and permutation tableaux
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4993550)
