Fertility, Strong Fertility, and Postorder Wilf Equivalence
From MaRDI portal
Publication:5109059
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.
Recommendations
- The Generalized Borel Conjecture and Strongly Proper Orders
- Strong convergence in posets
- On characterizations of strong posets
- On super-strong Wilf equivalence classes of permutations
- Strong sets on posets and some applications
- Cardinal Conditions for Strong Fubini Theorems
- Strong order equivalence
- Constraining strong \(c\)-Wilf equivalence using cluster poset asymptotics
- scientific article; zbMATH DE number 1145215
- The strong selection property and ordered sets of finite length
Cites work
- A combinatorial proof of J. West's conjecture
- A new class of Wilf-equivalent permutations
- A simplicial complex of 2-stack sortable permutations
- A survey of stack-sorting disciplines
- Actions on permutations and unimodality of descent polynomials
- Catalan intervals and uniquely sorted permutations
- Classification of bijections between 321- and 132-avoiding permutations
- Combinatorics of permutations
- Counting 3-stack-sortable permutations
- Descents in t-sorted permutations
- Describing West-3-stack-sortable permutations with permutation patterns
- Egge triples and unbalanced Wilf equivalence
- Enumeration of Stack-Sorting Preimages via a Decomposition Lemma
- Fighting fish and two-stack sortable permutations
- Further bijections to pattern-avoiding valid hook configurations
- scientific article; zbMATH DE number 6016068 (Why is no real title available?)
- scientific article; zbMATH DE number 5729471 (Why is no real title available?)
- scientific article; zbMATH DE number 3473265 (Why is no real title available?)
- Lattice paths and pattern-avoiding uniquely sorted permutations
- Multi-static enumeration of two-stack sortable permutations
- On linear transformations preserving the Pólya frequency property
- On Schemmel nontotient numbers
- Patterns in permutations and words.
- Permutations with forbidden subsequences and nonseparable planar maps
- Polyurethane toggles
- Postorder Preimages
- Preimages under the stack-sorting algorithm
- Raney paths and a combinatorial relationship between rooted nonseparable planar maps and two-stack-sortable permutations
- Refined enumeration of permutations sorted with two stacks and a D₈-symmetry
- Sorted and/or sortable permutations
- Stack words and a bound for 3-stack sortable permutations
- Stack-sorting for words
- Stack-sorting, set partitions, and Lassalle's sequence
- Symmetry and unimodality in \(t\)-stack sortable permutations
- Two examples of unbalanced Wilf-equivalence
Cited in
(14)- Restricted stacks as functions
- Further bijections to pattern-avoiding valid hook configurations
- Troupes, cumulants, and stack-sorting
- Catalan intervals and uniquely sorted permutations
- Fertility numbers
- Polyurethane toggles
- Fertility monotonicity and average complexity of the stack-sorting map
- Counting 3-stack-sortable permutations
- Operators of equivalent sorting power and related Wilf-equivalences
- Enumeration of Stack-Sorting Preimages via a Decomposition Lemma
- Lattice paths and pattern-avoiding uniquely sorted permutations
- Fertilitopes
- Stack-sorting preimages and 0-1-trees
- Boolean-Narayana numbers
This page was built for publication: Fertility, Strong Fertility, and Postorder Wilf Equivalence
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5109059)
