The Eulerian numbers on restricted centrosymmetric permutations
Abstract
We study the descent distribution over the set of centrosymmetric permutations that avoid the pattern of length 3. Our main tool in the most puzzling case, namely, τ=123 and n even, is a bijection that associates a Dyck prefix of length 2n to every centrosymmetric permutation in S2n that avoids 123.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.