On partial well-order for monotone grid classes of permutations
Vincent Vatter, Steve Waton

TL;DR
This paper provides a simplified proof that monotone grid classes of permutations, specifically those defined by forest structures, are partially well-ordered, contributing to the understanding of their structural properties.
Contribution
It offers a simplified proof of partial well-ordering for monotone grid classes of forests, enhancing theoretical understanding of these permutation classes.
Findings
Monotone grid classes of forests are partially well-ordered.
Simplified proof of Murphy and Vatter's result.
Structural properties of permutation classes clarified.
Abstract
A monotone grid class is a permutation class (i.e., a downset of permutations under the containment order) defined by local monotonicity conditions. We give a simplified proof of a result of Murphy and Vatter that monotone grid classes of forests are partially well-ordered.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsAlgorithms and Data Compression · Bayesian Methods and Mixture Models · Advanced Combinatorial Mathematics
