Skip to content
DraconiticResearch
Search Sources API
194,161 studies31 sourcesUpdated 18 min ago
PreprintarXiv licencearXiv

A Short Proof of Zhang's Conjecture on Stack-Sortable Permutations

  • Maximus Lu
Open at sourcePDFDOICite

Abstract

We give a short proof of Zhang's conjecture that the number of stack-sortable permutations of length n + 1 which end in their smallest element is equal to the n-th Motzkin number.

Related

  1. On a conjecture concerning two-stack sortable permutations
    Yongzhou Wen, Sherry H. F. Yan
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  2. A Short Proof of a Theorem of Pan and Zhang
    Xiangyu Wang
    arXivPreprintCC0Full textAlgebra & number theoryarXiv
  3. Motzkin Numbers Count 2-Stack-Sortable Permutations Ending in Their Least Entry
    Ryota Inagaki, Michael Luo
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsarXiv
  4. A short polyhedral proof of the infinitesimal Stoker conjecture
    Martin Winter
    arXivPreprintCC BY 4.0Full textCombinatorics & discrete mathematicsGeometry & topologyarXiv
  5. A very short unified proof of Dar's conjecture and Log-Brunn--Minkowski in the plane
    Dongmeng Xi
    arXivPreprintCC0Full textGeometry & topologyarXiv

Cite

BibTeXRIS
BibTeX
@misc{lu2026short,
  title = {{A Short Proof of Zhang's Conjecture on Stack-Sortable Permutations}},
  author = {Maximus Lu},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2610.32824},
  eprint = {2610.32824},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.32824},
}
RIS
TY  - UNPB
TI  - A Short Proof of Zhang's Conjecture on Stack-Sortable Permutations
AU  - Maximus Lu
PY  - 2026
DA  - 2026/10/23
PB  - arXiv
DO  - 10.48550/arxiv.2610.32824
UR  - https://arxiv.org/abs/2610.32824
AB  - We give a short proof of Zhang's conjecture that the number of stack-sortable permutations of length n + 1 which end in their smallest element is equal to the n-th Motzkin number.
ER  -