Enumerations for Permutations by Circular Peak Sets
| dc.creator | Bouchard, Pierre | |
| dc.creator | Chang, Hungyung | |
| dc.creator | Ma, Jun | |
| dc.creator | Yeh, Jean | |
| dc.date | 2008-06-03 | |
| dc.date | 2008-06-05 | |
| dc.date.accessioned | 2026-07-07T09:42:35Z | |
| dc.date.available | 2026-07-07T09:42:35Z | |
| dc.description | The circular peak set of a permutation $σ$ is the set $\{σ(i)\mid σ(i-1)<σ(i)>σ(i+1)\}$. In this paper, we focus on the enumeration problems for permutations by circular peak sets. Let $cp_n(S)$ denote the number of the permutations of order $n$ which have the circular peak set $S$. For the case with $|S|=0,1,2$, we derive the explicit formulas for $cp_n(S)$. We also obtain some recurrence relations for the sequence $cp_n(S)$ and give the formula for $cp_n(S)$ in the general case. | |
| dc.identifier | https://arxiv.org/abs/0806.0435 | |
| dc.identifier | http://arxiv.org/abs/0806.0435 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/162232 | |
| dc.subject | Combinatorics | |
| dc.title | Enumerations for Permutations by Circular Peak Sets | |
| dc.type | text |