A Proof of Julian West’s Conjecture That the Number of Two-Stacksortable Permutations of Length N Is 2(3n)!/((N + 1)!(2n + 1)!)

Doron Zeilberger · 1992 · Discrete Mathematics · DOI 10.1016/0012-365x(92)90351-f

1 Pith paper cite this work, alongside 111 external citations. Polarity classification is still indexing.

1 Pith paper citing it

111 external citations · OpenAlex

open at publisher browse 1 citing papers

representative citing papers

math.CO · 2026-06-07 · unverdicted · novelty 6.0

The cardinality of s^{m-4}(S_{2m-4}) equals B_m plus (m^2 + 7m - 28)/2 for m at least 5.

Showing 1 of 1 citing paper.

A Characterization of the $2m-4$ Case of Highly Sorted Permutations math.CO · 2026-06-07 · unverdicted · none · ref 4
The cardinality of s^{m-4}(S_{2m-4}) equals B_m plus (m^2 + 7m - 28)/2 for m at least 5.