Avoiding 2-letter signed patterns
Abstract
Let Bn be the hyperoctahedral group; that is, the set of all signed permutations on n letters, and let Bn(T) be the set of all signed permutations in Bn which avoids a set T of signed patterns. In this paper, we find all the cardinalities of the sets Bn(T) where T ⊂eq B2. This allow us to express these cardinalities via inverse of binomial coefficients, binomial coefficients, Catalan numbers, and Fibonacci numbers.
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.