dorsal/arxiv
View SchemaOn symmetric pattern avoidance sets
| Authors | Tuong Le |
|---|---|
| Categories | |
| ArXiv ID | 2601.07195vv1 |
| URL | https://arxiv.org/abs/2601.07195 |
| License | http://creativecommons.org/licenses/by/4.0/ |
Abstract
For a set of permutations $S\subseteq S_n$, consider the quasisymmetric generating function $$Q(S): = \sum_{w\in S}F_{n, \mathrm{Des}(w)},$$ where $\mathrm{Des}(w) := \{i\mid w(i)> w(i+1)\}$ is the descent set of $w$ and $F_{n, \mathrm{Des}(w)}$ 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 $\Pi$ of permutations, let $S_n(\Pi)$ denote the set of permutations in $S_n$ that avoid all patterns in $\Pi.$ A set $\Pi$ is said to be symmetrically avoided (respectively, Schur-positively avoided) if $S_n(\Pi)$ is symmetric (respectively, Schur-positive) for all $n.$ Marmor proved in 2025 that for $n\ge 5$, a symmetric set $S\subseteq S_n$ has size at least $n-1$ unless $S\subseteq \{12\cdots n, n\cdots 21\}$ and asked for a general classification of the possible sizes of symmetric sets not containing the monotone elements $12\cdots n $ and $n\cdots 21$. We give a complete answer to this question for $n\ge 52.$ We also give a classification of symmetric sets of size at most $n-1$, thereby showing that they are actually Schur-positive, resolving a conjecture of Marmor. Finally, we give a classification of symmetrically avoided sets of size at most $n-1$, thereby showing that they are actually Schur-positively avoided.
{
"annotation_id": "4d747cfb-a69f-4d36-a820-3e03cac7ac37",
"date_created": "2026-02-17T05:53:11.755000Z",
"date_modified": "2026-02-17T05:53:11.755000Z",
"file_hash": "b279248f3cf5768a1031bd949c2e8468efe7d37a2892d96f730fa1b68e9595a7",
"private": false,
"record": {
"abstract": "For a set of permutations $S\\subseteq S_n$, consider the quasisymmetric generating function\n $$Q(S): = \\sum_{w\\in S}F_{n, \\mathrm{Des}(w)},$$\n where $\\mathrm{Des}(w) := \\{i\\mid w(i)\u003e w(i+1)\\}$ is the descent set of $w$ and $F_{n, \\mathrm{Des}(w)}$ is Gessel\u0027s 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 $\\Pi$ of permutations, let $S_n(\\Pi)$ denote the set of permutations in $S_n$ that avoid all patterns in $\\Pi.$ A set $\\Pi$ is said to be symmetrically avoided (respectively, Schur-positively avoided) if $S_n(\\Pi)$ is symmetric (respectively, Schur-positive) for all $n.$\n Marmor proved in 2025 that for $n\\ge 5$, a symmetric set $S\\subseteq S_n$ has size at least $n-1$ unless $S\\subseteq \\{12\\cdots n, n\\cdots 21\\}$ and asked for a general classification of the possible sizes of symmetric sets not containing the monotone elements $12\\cdots n $ and $n\\cdots 21$. We give a complete answer to this question for $n\\ge 52.$ We also give a classification of symmetric sets of size at most $n-1$, thereby showing that they are actually Schur-positive, resolving a conjecture of Marmor. Finally, we give a classification of symmetrically avoided sets of size at most $n-1$, thereby showing that they are actually Schur-positively avoided.",
"arxiv_id": "2601.07195",
"authors": [
"Tuong Le"
],
"categories": [
"math.CO"
],
"license": "http://creativecommons.org/licenses/by/4.0/",
"title": "On symmetric pattern avoidance sets",
"url": "https://arxiv.org/abs/2601.07195",
"version": "v1"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "82877aab-1904-422e-a689-aba57f25c229",
"id": "arXiv Dataset",
"type": "Model",
"variant": "snapshot-2026-01-17",
"version": "0.1.0"
},
"user_id": 1000002
}