\(1/k\)-Eulerian polynomials and \(k\)-inversion sequences (Q2318783): Difference between revisions

Summary: Let \(\mathbf{s} = (s_1, s_2, \ldots, s_n,\ldots)\) be a sequence of positive integers. An \(\mathbf{s}\)-inversion sequence of length \(n\) is a sequence \(\mathbf{e} = (e_1, e_2, \ldots, e_n)\) of nonnegative integers such that \(0 \leq e_i < s_i\) for \(1\leqslant i\leqslant n\). When \(s_i=(i-1)k+1\) for any \(i\geqslant 1\), we call the \(\mathbf{s}\)-inversion sequences the \(k\)-inversion sequences. In this paper, we provide a bijective proof that the ascent number over \(k\)-inversion sequences of length \(n\) is equidistributed with a weighted variant of the ascent number of permutations of order \(n\), which leads to an affirmative answer of a question of \textit{C. D. Savage} [J. Comb. Theory, Ser. A 144, 443--475 (2016; Zbl 1343.05032)]. A key ingredient of the proof is a bijection between \(k\)-inversion sequences of length \(n\) and \(2\times n\) arrays with particular restrictions. Moreover, we present a bijective proof of the fact that the ascent plateau number over \(k\)-Stirling permutations of order \(n\) is equidistributed with the ascent number over \(k\)-inversion sequences of length \(n\).