
TL;DR
This paper classifies symmetric and Schur-positive permutation sets based on pattern avoidance, resolving conjectures and extending previous results for large n, with a focus on sets of size up to n-1.
Contribution
It provides a complete classification of symmetric permutation sets for n ≥ 52 and confirms that small symmetric sets are Schur-positive, addressing open questions in the field.
Findings
Classifies symmetric sets of permutations of size at most n-1 as Schur-positive.
Provides a complete classification of symmetric sets for n ≥ 52.
Shows that symmetrically avoided sets of size at most n-1 are Schur-positively avoided.
Abstract
For a set of permutations , consider the quasisymmetric generating function where is the descent set of and is Gessel's fundamental quasisymmetric function. A set of permutations is said to be symmetric (respectively, Schur-positive) if its quasisymmetric generating function is symmetric (respectively, Schur-positive). Given a set of permutations, let denote the set of permutations in that avoid all patterns in A set is said to be symmetrically avoided (respectively, Schur-positively avoided) if is symmetric (respectively, Schur-positive) for all Marmor proved in 2025 that for , a symmetric set has size at least unless and…
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
TopicsAdvanced Combinatorial Mathematics · Genome Rearrangement Algorithms · Quasicrystal Structures and Properties
