Arithmetic properties of generalized Euler 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}\).
- Combinatorial interpretation of general Eulerian numbers
- Quasi-symmetric functions and up-down compositions
- Some arithmetic properties of the \(q\)-Euler numbers and \(q\)-Salié numbers
- Factors of the Gaussian coefficients
- scientific article; zbMATH DE number 5850891 (Why is no real title available?)
- scientific article; zbMATH DE number 5626054 (Why is no real title available?)
- Euler constants for arithmetic progressions
- On arithmetic properties of the convergents of Euler's number
- An operator on permutations and its application to Eulerian numbers
- A \(q\)-analogue of generalized Eulerian polynomials with applications
- On the q-extension of Euler and Genocchi numbers
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)