Logo image
Corners in Tree-Like Tableaux
Journal article   Open access   Peer reviewed

Corners in Tree-Like Tableaux

Pawel Hitczenko and Amanda Lohss
The Electronic journal of combinatorics, v 23(4)
10 Nov 2016
url
https://doi.org/10.37236/5712View
Published, Version of Record (VoR)CC BY V4.0 Open

Abstract

Mathematics Mathematics, Applied Physical Sciences Science & Technology
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 both conjectures. Our proofs are based on the bijection with permutation tableaux or type-B permutation tableaux and consequently, we also prove results for these tableaux. In addition, we derive the limiting distribution of the number of occupied corners in random tree-like tableaux and random symmetric tree-like tableaux.

Metrics

9 Record Views
5 citations in Scopus

Details

UN Sustainable Development Goals (SDGs)

This publication has contributed to the advancement of the following goals:

#4 Quality Education

InCites Highlights

Data related to this publication, from InCites Benchmarking & Analytics tool:

Web of Science research areas
Mathematics
Mathematics, Applied
Logo image