





















Abstract:In this paper, we complete the enumeration of the number of parking functions of length $n$ avoiding, in the sense defined by Qiu and Remmel, a permutation of length 3, answering several questions of Adeniran and Pudwell. Additionally, we provide explicit growth rates for the number of parking functions of length $n$ avoiding a monotonic pattern of any length. As a consequence of our techniques we additionally provide a combinatorial enumeration for the number of equivalence classes of words with a fixed content under the Sylvester congruence.
| Comments: | 18 Pages |
| Subjects: | Combinatorics (math.CO) |
| Cite as: | arXiv:2605.24092 [math.CO] |
| (or arXiv:2605.24092v1 [math.CO] for this version) | |
| https://doi.org/10.48550/arXiv.2605.24092 arXiv-issued DOI via DataCite (pending registration) |
From: Ben Adenbaum [view email]
[v1]
Fri, 22 May 2026 18:00:07 UTC (23 KB)
此内容由惯性聚合(RSS阅读器)自动聚合整理,仅供阅读参考。 原文来自 — 版权归原作者所有。