A Proof of Rubey's Lattice Conjecture
Sara C. Billey, Connor McCausland, Clare Minnerath
TL;DR
This work resolves Rubey's lattice conjecture by introducing the move operator ${\mathcal{M}}_{ij}$ and a constructive join algorithm for reduced pipe dreams. It proves that for every permutation $w$, the Rubey poset $( {\textnormal{RPD}}(w),<)$ is a lattice, with meets obtained via transpose and joins computed through a recursive procedure based on principal disagreements. A comparability criterion is provided using pipe dream tableaux ${\mathbf{T}}(D)$, enabling efficient comparison and enabling bounds on the total number of reduced pipe dreams and maximal chain length. The results connect to Schubert polynomials and offer a concrete, tableau-driven perspective on Rubey lattices, with several open directions for explicit tableau characterizations and sampling on Rubey lattices.
Abstract
In 2011, Rubey generalized chute and ladder moves on the set of reduced pipe dreams for a permutation $w$ and conjectured that the induced poset on reduced pipe dreams is a lattice. In this paper, we prove this conjecture. Our key tool is a new type of move operation $\mathcal{M}_{ij}$, defined as a composite of certain general ladder moves in Rubey's poset. We show that joins and meets exist in Rubey's poset by proving simple recursive formulas in terms of $\mathcal{M}_{ij}$ operations. In addition, we give an explicit criterion to determine if two elements of Rubey's poset are comparable.
