Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2025
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2502.10727 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Table of Contents:
- In this paper, we use Hasse diagrams and generating functions to count alternating permutations with restricted prefix and suffix of lengths 3 and 4. In other words, for an alternating permutation $σ=σ_1σ_2σ_3\cdotsσ_{n}\in S_{n}$, we restrict length-3 prefixes $σ_1σ_2σ_3$ to follow certain patterns, such as $231$ and $132$, or follow certain restrictions such as $σ_2 \geq \max\{σ_1,σ_3\}+2$, similarly for prefixes of length 4. We also study the enumeration of alternating permutations with restrictions on both prefix and suffix.