Skip to content
DraconiticResearch
Search Sources API
203,234 studies31 sourcesUpdated 33 min ago
PreprintCC BY 4.0arXiv

Pattern restricted parking functions with limited preferences

  • Kassie Archer
  • Robert Laudone
Open at sourcePDFDOICite

Abstract

A parking function is said to have ℓ-limited preferences if there are at most ℓ copies of each element in the parking function. In this paper, we define a notion of pattern avoidance for parking functions and enumerate those $2$-limited parking functions that avoid certain patterns.

Related

  1. Pattern avoidance classes of parking permutations with fixed lucky sets
    Melanie Ferreri, Lucy Martinez
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  2. Characterizing k-Naples parking functions and refining bounds via obstructed parking functions
    Roger Tian
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv
  3. A new generalization of parking functions: ρ-Naples parking functions
    Luca Ferrari, Francesco Verciani
    arXivPreprintCC BY-NC-SA 4.0Full textCombinatorics & discrete mathematicsarXiv
  4. A total variation threshold for the first coordinates of uniform parking functions via Lorentzian polynomials
    Igor Kortchemski
    arXivPreprintarXiv licenceFull textProbabilityarXiv
  5. Symmetries on vector parking functions via bounded lattice paths
    Wenjie Fang, Yang Li, Zhicong Lin
    arXivPreprintarXiv licenceFull textCombinatorics & discrete mathematicsarXiv

Cite

BibTeXRIS
BibTeX
@misc{archer2026pattern,
  title = {{Pattern restricted parking functions with limited preferences}},
  author = {Kassie Archer and Robert Laudone},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2610.02489},
  eprint = {2610.02489},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.02489},
  note = {CC BY 4.0},
}
RIS
TY  - UNPB
TI  - Pattern restricted parking functions with limited preferences
AU  - Kassie Archer
AU  - Robert Laudone
PY  - 2026
DA  - 2026/10/01
PB  - arXiv
DO  - 10.48550/arxiv.2610.02489
UR  - https://arxiv.org/abs/2610.02489
AB  - A parking function is said to have ℓ-limited preferences if there are at most ℓ copies of each element in the parking function. In this paper, we define a notion of pattern avoidance for parking functions and enumerate those $2$-limited parking functions that avoid certain patterns.
ER  -