Generalizations of two-stack-sortable permutations
Abstract
In this thesis, we apply the stack sorting operator to r-permutations and construct the functional equation for the generating function of two-stack-sortable k-tuple r-permutations counted by descents by using a factorization similar to Zeilberger's. We solve the functional equation and give explicit formulas for the number of two-stack-sortable r-permutations.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.