Metraipolis › archive › dc_0cd5fa200942

Pattern avoidance classes of parking permutations with fixed lucky sets — arXiv:2611.07267

Source
arXiv (en)
Original
https://arxiv.org/abs/2611.07267
License (as archived)
CC0-1.0
Archived
2026-11-06T14:52:41.030Z
SHA-256 of the archived text
459bcfe119c7764f6f737f20f4cf266e34535ac69e510fc448935faf949d3d46
Stable URL of this page
https://metraipolis.com/documento/dc_0cd5fa200942

How to cite

Pattern avoidance classes of parking permutations with fixed lucky sets — arXiv:2611.07267 — arXiv (en), https://arxiv.org/abs/2611.07267 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_0cd5fa200942 (Metraipolis archive dc_0cd5fa200942, sha256 459bcfe119c7764f6f737f20f4cf266e34535ac69e510fc448935faf949d3d46)
BibTeX
@misc{dc0cd5fa200942,
  title = {Pattern avoidance classes of parking permutations with fixed lucky sets — arXiv:2611.07267},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2611.07267},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_0cd5fa200942; sha256 459bcfe119c7764f6f737f20f4cf266e34535ac69e510fc448935faf949d3d46},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.07267. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

For a parking function, the resulting sequence after all cars have parked is called the associated parking permutation. For each parking function, cars that park in their preferred spot are called lucky cars. In this paper, we enumerate parking permutations that avoid a specified set of permutation patterns in $\mathfrak{S}_3$ and whose lucky cars are the first $k$ cars. Often, the enumeration simplifies to a product of a fraction with a binomial coefficient, recovering existing sequences in the OEIS. For two of the classes, the enumerations are new sequences.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.CO, nuovi lavori del giorno).
Categorie arXiv: Combinatorics (math.CO).
Pagina del lavoro: https://arxiv.org/abs/2611.07267 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-06T14:24:27.839Z dalla pagina https://arxiv.org/list/math.CO/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).