Corners in tree-like tableaux
Abstract
In this paper, we study tree--like tableaux, combinatorial objects which exhibit a natural tree structure and are connected to the partially asymmetric simple exclusion process (PASEP). There was a conjecture made on the total number of corners in tree--like tableaux and the total number of corners in symmetric tree--like tableaux. In this paper, we prove the first conjecture leaving the proof of the second conjecture to the full version of this paper. Our proofs are based on the bijection with permutation tableaux or type--B permutation tableaux and consequently, we also prove results for these tableaux.
Cite
@article{arxiv.1511.04989,
title = {Corners in tree-like tableaux},
author = {Pawel Hitczenko and Amanda Lohss},
journal= {arXiv preprint arXiv:1511.04989},
year = {2016}
}
Comments
Version 2 is an extended abstract to appear in Proceedings of the 27th International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms, Krakow, Poland, 4-8 July 2016. Version 1 is the full paper