Resolving two conjectures on staircase encodings and boundary grids of \(132\) and \(123\)-avoiding permutations (Q2325762)

Summary: This paper analyzes relations between pattern avoidance of certain permutations and graphs on staircase grids and boundary grids, and proves two conjectures posed by \textit{C. Bean}, \textit{M. Tannock} and \textit{H. Ulfarsson} [``Pattern avoiding permutations and independent sets in graphs'', Preprint, \url{https://arxiv.org/abs/1512.08155}]. More specifically, this paper enumerates a certain family of staircase encodings and proves that the downcore graph, a certain graph established on the boundary grid, is pure if and only if the permutation corresponding to the boundary grid avoids the classical patterns \(123\) and \(2143\).