2014
DOI: 10.1016/j.jcta.2014.08.002
|View full text |Cite
|
Sign up to set email alerts
|

Descent sets on 321-avoiding involutions and hook decompositions of partitions

Abstract: We show that the distribution of the major index over the set of involutions in S n that avoid the pattern 321 is given by the q-analogue of the n-th central binomial coefficient. The proof consists of a composition of three non-trivial bijections, one being the Robinson-Schensted correspondence, ultimately mapping those involutions with major index m into partitions of m whose Young diagram fits inside a ⌊ n 2 ⌋ × ⌈ n 2 ⌉ box. We also obtain a refinement that keeps track of the descent set, and we deduce an a… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
44
0

Year Published

2015
2015
2021
2021

Publication Types

Select...
6

Relationship

1
5

Authors

Journals

citations
Cited by 20 publications
(44 citation statements)
references
References 26 publications
0
44
0
Order By: Relevance
“…Recently, Barnabei et al [2] proved that the distribution of the major index over 321-avoiding involutions is given by…”
Section: Enumeration Of 321-avoiding Involutionsmentioning
confidence: 99%
See 4 more Smart Citations
“…Recently, Barnabei et al [2] proved that the distribution of the major index over 321-avoiding involutions is given by…”
Section: Enumeration Of 321-avoiding Involutionsmentioning
confidence: 99%
“…To prove Theorem 1.2, we make use of a bijection given by Barnabei et al [2] to transform a partial Dyck path of length n into a lattice path going from (0, 0) to (⌈ n 2 ⌉, ⌊ n 2 ⌋) using N and E steps without restriction, called a grand Dyck path of length n. It is known that the area above the grand Dyck path within the ⌊ n 2 ⌋ × ⌈ n 2 ⌉ rectangle coincides with the major index of 321-avoiding involutions. Then we prove Theorem 1.2 by establishing an area-parity-reversing involution on grand Dyck paths (see Propositions 5.4, 5.8 and 5.11).…”
Section: Combinatorial Approachmentioning
confidence: 99%
See 3 more Smart Citations