Arithmetic properties of generalized Euler numbers

From MaRDI portal



Abstract: The generalized Euler number E_{n|k} counts the number of permutations of {1,2,...,n} which have a descent in position m if and only if m is divisible by k. The classical Euler numbers are the special case when k=2. In this paper, we study divisibility properties of a q-analog of E_{n|k}. In particular, we generalize two theorems of Andrews and Gessel about factors of the q-tangent numbers.


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}\).











This page was built for publication: Arithmetic properties of generalized Euler numbers

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