Arithmetic properties of generalized Euler numbers (Q1369333): Difference between revisions

The generalized Euler numbers \(E_{n| k}\) count the number of permutations which have a descent in position \(n\) if and only if \(n\) is a multiple of \(k\). A \(q\)-analogue of \(E_{n| k}\) is given by the generating function (with respect to the variable \(q\)) of the number of inversions in the above set of permutations. The main result of the paper asserts that if \(k\) is prime and \(1\leq i\leq k-1\), then the \(q\)-analogue \(E_{nk+ i| k}(q)\) is divisible by \([k]_q [k]_{q^2}\dots [k]_{q^n}\) and by \([k]_q^n\), where, as usual, \([k]_l= 1+ l+\cdots+ l^{k-1}\).