A reciprocity method for computing generating functions over the set of permutations with no consecutive occurrence of \tau
In this paper, we introduce a new method for computing generating functions with respect to the number of descents and left-to-right minima over the set of permutations which have no consecutive occurrences of a pattern that starts with 1.
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Zusammenfassung: | In this paper, we introduce a new method for computing generating functions
with respect to the number of descents and left-to-right minima over the set of
permutations which have no consecutive occurrences of a pattern that starts
with 1. |
|---|---|
| DOI: | 10.48550/arxiv.1201.0142 |