Enumerations for Permutations by Circular Peak Sets

arXiv0806.0435MaRDI QIDQ6209769FDOQ6209769

Jun Ma, Hungyung Chang, Jean Yeh, Pierre Bouchard

Publication date: 3 June 2008

Abstract: The circular peak set of a permutation $sigma$ is the set $sigma(i)midsigma(i-1)<sigma(i)>sigma(i+1)$. In this paper, we focus on the enumeration problems for permutations by circular peak sets. Let $c{p}_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 $c{p}_n(S)$. We also obtain some recurrence relations for the sequence $c{p}_n(S)$ and give the formula for $c{p}_n(S)$ in the general case.

This page was built for publication: Enumerations for Permutations by Circular Peak Sets

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6209769)