Resolving two conjectures on staircase encodings and boundary grids of 132 and 123-avoiding permutations

From MaRDI portal
Publication:2325762

zbMATH Open1420.05008arXiv1802.06345MaRDI QIDQ2325762FDOQ2325762


Authors: Shyam Narayanan Edit this on Wikidata


Publication date: 30 September 2019

Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)

Abstract: This paper analyzes relations between pattern avoidance of certain permutations and graphs on staircase grids and boundary grids, and proves two conjectures posed by Bean, Tannock, and Ulfarsson (2015). 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.


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

File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)



Recommendations




Cites Work


Cited In (2)





This page was built for publication: Resolving two conjectures on staircase encodings and boundary grids of \(132\) and \(123\)-avoiding permutations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2325762)