PreprintarXiv licencearXiv
A combinatorial proof of the Chan--Robbins--Yuen volume formula
Abstract
The Chan--Robbins--Yuen polytope CRYm+1 has normalized volume ∏j=1m−1Cj, a product of Catalan numbers. Zeilberger proved the formula using the Morris constant-term identity; finding a combinatorial proof remained an open problem. We give such a proof by counting nonnegative integer flows. We add an extra edge from each vertex to a common sink and count flows according to how many of these edges carry positive flow. A double count proves a special case of a recurrence of Morales and Shi and gives these counts in terms of Narayana numbers. Deleting the first vertex then yields the Catalan product. We also give an explicit bijection for the recurrence and prove the corresponding reduction formula posed by Postnikov.
Related
- A Combinatorial Formula and a Hilbert Scheme Realization of a Rank-One Virasoro Irregular Conformal Block
- A combinatorial proof of the quadratic Gauss sum
- A Short Combinatorial Proof of the Pons-Batle Identity for Counting Tree-Child Networks
- A Combinatorial Proof of an Identity of Malik and Sarma on Overpartitions with Repeated Smallest Non-Overlined Part
- A Combinatorial Proof of Partition Identities for the Number of Distinct Part Sizes
BibTeX
@misc{shyntas2026combinatorial,
title = {{A combinatorial proof of the Chan--Robbins--Yuen volume formula}},
author = {Nurtas Shyntas},
howpublished = {arXiv},
year = {2026},
month = oct,
doi = {10.48550/arxiv.2610.19119},
eprint = {2610.19119},
archivePrefix = {arXiv},
url = {https://arxiv.org/abs/2610.19119},
}
RIS
TY - UNPB
TI - A combinatorial proof of the Chan--Robbins--Yuen volume formula
AU - Nurtas Shyntas
PY - 2026
DA - 2026/10/13
PB - arXiv
DO - 10.48550/arxiv.2610.19119
UR - https://arxiv.org/abs/2610.19119
AB - The Chan--Robbins--Yuen polytope CRY_m+1 has normalized volume ∏_j=1^m−1C_j, a product of Catalan numbers. Zeilberger proved the formula using the Morris constant-term identity; finding a combinatorial proof remained an open problem. We give such a proof by counting nonnegative integer flows. We add an extra edge from each vertex to a common sink and count flows according to how many of these edges carry positive flow. A double count proves a special case of a recurrence of Morales and Shi and gives these counts in terms of Narayana numbers. Deleting the first vertex then yields the Catalan product. We also give an explicit bijection for the recurrence and prove the corresponding reduction formula posed by Postnikov.
ER -