arXiv (All)
open access
Pattern restricted parking functions with limited preferences
A parking function is said to have $\ell$-limited preferences if there are at most $\ell$ 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.
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Emerging consecutive pattern avoidance#1325052
- Copy-Protection with Correlated Challenges: Point Functions and More via Decisional Coset Monogamy#467076
- $q$-Difference Equations for two classes of Pattern Avoiding Permutations#615164
- $q$-Difference Equations for two classes of Pattern Avoiding Permutations#614197
- Narrowing Data Protection's Enforcement Gap#964839
Record · ID 1186803
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive