A quick proof that 321-avoiding permutations without double deficiencies are counted by the Motzkin numbers

Abstract

We present a short "proof from the Book" that 321-avoiding permutations without double deficiencies are counted by the Motzkin numbers. Although this result was first proved by Rubey and Stump, our proof gives a much simpler and more transparent description of the same bijection.

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.

Discussion (0)

Sign in to join the discussion.

Loading comments…