On the construction of Eulerian permutations (Q4354092)

Let \(S_n\) be the set of all permutations on \(\{1,2,\dots,n\}\). For \(\sigma=\sigma_1\sigma_2\cdots\sigma_n\in S_n\), the pair \(\sigma_i\), \(\sigma_{i+1}\) is called a rise if \(\sigma_i<\sigma_{i+1}\), where \(1\leq i\leq n-1\). For an integer \(k\) with \(0\leq k\leq n-1\), let \(E_n(k)\) denote the set of all permutations in \(S_n\) with exactly \(k\) rises. The authors give an algorithmic construction of \(E_n(k)\).