Efficient recurrence for the enumeration of permutations with fixed pinnacle set
Initiated by Davis, Nelson, Petersen and Tenner (2018), the enumerative study of pinnacle sets of permutations has attracted a fair amount of attention recently. In this article, we provide a recurrence that can be used to compute efficiently the number {Gn(P)| of permutations of size n with a given...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Discrete Mathematics and Theoretical Computer Science
2022
|
| Subjects: | |
| Online Access: | View Fulltext in Publisher |