paper

Refined Wilf-equivalences by Comtet statistics

arXiv:2009.04269

Abstract

We launch a systematic study of the refined Wilf-equivalences by the statistics and , where and are the number of components and the length of the initial ascending run of a permutation , respectively. As Comtet was the first one to consider the statistic in his book {\em Analyse combinatoire}, any statistic equidistributed with over a class of permutations is called by us a {\em Comtet statistic} over such class. This work is motivated by a triple equidistribution result of Rubey on -avoiding permutations, and a recent result of the first and third authors that is a Comtet statistic over separable permutations. Some highlights of our results are: (1) Bijective proofs of the symmetry of the double Comtet distribution over several Catalan and Schröder classes, preserving the values of the left-to-right maxima. (2) A complete classification of - and -Wilf-equivalences for length patterns and pairs of length patterns. Calculations of the generating functions over these pattern avoiding classes and separable permutations. (3) A further refinement by the Comtet statistic , of Wang's recent descent-double descent-Wilf equivalence between separable permutations and -avoiding permutations.

39 pages, 2 tables, 2 figures. Comments are welcome