arXiv (All)
open access
Symmetries on vector parking functions via bounded lattice paths
Partly motivated by enumeration of parking functions and their variants, there is a long-standing interest in lattice paths refined by several statistics, including the notable $\mathsf{run}$ and $\mathsf{return}$. We consider bounded lattice paths, which are bounded by a given lattice path and are
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
- Lattices with Large Kissing Number from Local Density#1325276
- Joint Exclusivity#1198905
- Poisson occupancy of paths on permuted regular graphs#1325620
- Mutually unbiased bases as extremal probes of isotropic random Hamiltonians#793675
- Mutually unbiased bases as extremal probes of isotropic random Hamiltonians#789671
Record · ID 1201678
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