arXiv (All)
open access
Motzkin Numbers Count 2-Stack-Sortable Permutations Ending in Their Least Entry
We prove the following conjecture of Zhang (arXiv:2604.10779, Conjecture 6.1): for $n \geq 0$, the number of $2$-stack-sortable permutations of $\{0,1,\dots,n\}$ ending in $0$ is the $n$th Motzkin number. By Zhang's result, there is a bijection between $2$-stack-sortable permutations ending in their
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
- Enumeration of interval-closed sets via Motzkin paths and quarter-plane walks#1324996
- A Proof of Rubey's Lattice Conjecture#1155049
- A 4AP-free permutation of the positive integers#1070248
- Weighted averages and applications to sets of multiple recurrence#1122579
- Recurrences for permutations with long increasing subsequences#822612
Record · ID 1187070
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