Fertility numbers
From MaRDI portal
Abstract: A nonnegative integer is called a fertility number if it is equal to the number of preimages of a permutation under West's stack-sorting map. We prove structural results concerning permutations, allowing us to deduce information about the set of fertility numbers. In particular, the set of fertility numbers is closed under multiplication and contains every nonnegative integer that is not congruent to modulo . We show that the lower asymptotic density of the set of fertility numbers is at least . We also exhibit some positive integers that are not fertility numbers and conjecture that there are infinitely many such numbers.
Recommendations
Cited in
(14)- Preimages under the bubblesort operator
- Fertility monotonicity and average complexity of the stack-sorting map
- Counting 3-stack-sortable permutations
- Sorting with a popqueue
- Fertility in the absence of self-control
- Polyurethane toggles
- Highly sorted permutations with respect to a 312-avoiding stack
- Periodic points of consecutive-pattern-avoiding stack-sorting maps
- Stack-sorting with stacks avoiding vincular patterns
- Fertilitopes
- Stack-sorting for words
- Restricted stacks as functions
- Further bijections to pattern-avoiding valid hook configurations
- Lattice paths and pattern-avoiding uniquely sorted permutations
This page was built for publication: Fertility numbers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2188744)