Arithmetic properties of generalized Euler numbers

dc.creatorSagan, Bruce E.
dc.creatorZhang, Ping
dc.date1998-01-02
dc.date.accessioned2026-07-07T05:23:29Z
dc.date.available2026-07-07T05:23:29Z
dc.descriptionThe 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.
dc.description9 pages, 0 figures, Latex, see related papers at http://www.math.msu.edu/~sagan
dc.identifierhttps://arxiv.org/abs/math/9801010
dc.identifierhttp://arxiv.org/abs/math/9801010
dc.identifierSoutheast Asian Bull. Math. 21 (1997), 73-78
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/76454
dc.subjectCombinatorics
dc.subject11B68 (Primary) 11A07, 11B65, 05A30 (Secondary)
dc.titleArithmetic properties of generalized Euler numbers
dc.typetext

Files

Collections