Permutations avoiding a set of patterns from S3 and a pattern from S4
Abstract
In this paper we calculate the cardinality of the set Sn(T,tau) of all permutations in Sn that avoid one pattern from S4 and a nonempty set of patterns from S3.
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.