A proof of Julian West's conjecture that the number of two-stacksortable permutations of length n is 2(3n)!/((n + 1)!(2n + 1)!)

Research output: Contribution to journalArticlepeer-review

49 Scopus citations

Abstract

The Polya-Schutzenberger-Tutte methodology of weight enumeration, combined with about 10 hours of CPU time (of Maple running on Drexel University's Sun network) established Julian West's conjecture that 2-stack-sortable permutations are enumerated by sequence #651 in the Sloane listing.

Original languageEnglish (US)
Pages (from-to)85-93
Number of pages9
JournalDiscrete Mathematics
Volume102
Issue number1
DOIs
StatePublished - May 18 1992
Externally publishedYes

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics

Fingerprint Dive into the research topics of 'A proof of Julian West's conjecture that the number of two-stacksortable permutations of length n is 2(3n)!/((n + 1)!(2n + 1)!)'. Together they form a unique fingerprint.

Cite this