Sorting networks, staircase Young tableaux, and last passage percolation

zbMath1447.05218arXiv2003.03331MaRDI QIDQ2199826

Dan Romik, Shane Gibbons, Elia Bisi, Fabio Deelan Cunden

Publication date: 14 September 2020

Published in: Séminaire Lotharingien de Combinatoire (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2003.03331

zbMATH Keywords

last passage percolationsorting networkoriented swap processstaircase Young tableaux

Mathematics Subject Classification ID

Combinatorial aspects of representation theory (05E10) Combinatorial probability (60C05)

Related Items (6)

Absorbing time asymptotics in the oriented swap process ⋮ Cutoff profile of ASEP on a segment ⋮ The oriented swap process and last passage percolation ⋮ Shift-invariance of the colored TASEP and finishing times of the oriented swap process ⋮ The geometric Burge correspondence and the partition function of polymer replicas ⋮ OrientedSwaps

Cites Work

• Unnamed Item
• Growth diagrams, and increasing and decreasing chains in fillings of Ferrers shapes
• The oriented swap process
• An extension of Schensted's theorem
• The local limit of random sorting networks
• Balanced tableaux
• GOE and \(\text{Airy}_{2\rightarrow 1}\) marginal distribution via symplectic Schur functions
• Random sorting networks
• The Surprising Mathematics of Longest Increasing Subsequences
• Circular support in random sorting networks

This page was built for publication: Sorting networks, staircase Young tableaux, and last passage percolation