arXiv (All)
open access
Circular s-choice parking functions: an exact closed formula via rotational symmetry
We study a circular variant of the $s$-choice parking model: $n$ cars park on $m=n+1$ spots arranged on a circle, each car carrying an anchor and $s-1$ clockwise increments at least $d$ apart with return gap at least $d$; a car tries its choices in order and then sweeps clockwise from its last choic
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
- Clique Number of Tournaments II#984399
- The Erdős Matching Conjecture for 4-uniform hypergraphs#1070833
- Improved upper bounds on the list chromatic number of $K_t$-minor-free graphs#1157217
- Combinatorial Theory: Introduction to Graph Theory, Extremal and Enumerative Combinatorics#66909
- A proof of the Holmes-Holroyd-Ramirez cyclic-product conjecture#1064387
Record · ID 1049346
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