Fertility, Strong Fertility, and Postorder Wilf Equivalence

TL;DR

This paper introduces new variants of Wilf equivalence for permutation classes, using sliding operators and valid hook configurations to establish infinite families of equivalences and generalize several known results.

Contribution

It defines fertility, strong fertility, and postorder Wilf equivalences, and develops bijections via sliding operators to produce numerous new equivalences and generalizations.

Findings

Infinite families of fertility equivalences established.

Generalizations of known results by Bouvel, Guibert, and the author.

Proved and extended a conjecture related to stack-sorting and Boolean-Catalan numbers.

Abstract

We introduce "fertility Wilf equivalence," "strong fertility Wilf equivalence," and "postorder Wilf equivalence," three variants of Wilf equivalence for permutation classes that formalize some phenomena that have appeared in the study of West's stack-sorting map. We introduce "sliding operators" and show that they induce useful bijections among sets of valid hook configurations. Combining these maps with natural decompositions of valid hook configurations, we give infinitely many examples of fertility, strong fertility, and postorder Wilf equivalences. As a consequence, we obtain infinitely many joint equidistribution results concerning many permutation statistics. In one very special case, we reprove and extensively generalize a result of Bouvel and Guibert. Another case reproves and generalizes a result of the current author. A separate very special case proves and generalizes a conjecture of the current author concerning stack-sorting preimages and the Boolean-Catalan numbers. We end with two open questions.