In this thesis, we primarily study corners in Tree-like and Permutation Tableaux. 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 n is normally distributed. Furthermore, since the number of corners in Tree-like Tableaux are closely related to the number of corners in Permutation Tableaux, we discuss the corners in the context of the latter tableaux. Finally, using analogous techniques, we prove a central limit theorem for the number of corners in Symmetric Tree-like Tableaux and Type-B Permutation Tableaux.
Metrics
20 File views/ downloads
28 Record Views
Details
Title
Central Limit Theorems for Tableaux Related to the Partially Asymmetric Simple Exclusion Process
Creators
Aleksandr Yaroslavskiy
Contributors
Pawel Hitczenko (Advisor)
Awarding Institution
Drexel University
Degree Awarded
Doctor of Philosophy (Ph.D.)
Publisher
Drexel University; Philadelphia, Pennsylvania
Number of pages
vii, 58 pages
Resource Type
Dissertation
Language
English
Academic Unit
College of Arts and Sciences; Drexel University; Mathematics
Other Identifier
991014695137704721
Research Home Page
Browse by research and academic units
Learn about the ETD submission process at Drexel
Learn about the Libraries’ research data management services