
doi: 10.37236/1687
We obtain a characterization of $(321, 3\bar{1}42)$-avoiding permutations in terms of their canonical reduced decompositions. This characterization is used to construct a bijection for a recent result that the number of $(321,3\bar{1}42)$-avoiding permutations of length $n$ equals the $n$-th Motzkin number, due to Gire, and further studied by Barcucci, Del Lungo, Pergola, Pinzani and Guibert. Similarly, we obtain a characterization of $(231,4\bar{1}32)$-avoiding permutations. For these two classes, we show that the number of descents of a permutation equals the number of up steps on the corresponding Motzkin path. Moreover, we find a relationship between the inversion number of a permutation and the area of the corresponding Motzkin path.
Permutations, words, matrices, Exact enumeration problems, generating functions
Permutations, words, matrices, Exact enumeration problems, generating functions
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 2 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Average | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
