A new refinement of Euler numbers on counting alternating permutations
Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:CBWIABFSrecord.jsonopen to challenge →
classification
math.CO
keywords
numberseulerpermutationsalternatingrefinementanswerarticlecalculus
read the original abstract
At a crossroads of calculus and combinatorics, the generating function of secant and tangent numbers (Euler numbers) provides enumeration of alternating permutations. In this article, we present a new refinement of Euler numbers to answer the combinatorial question on some particular relation of Euler numbers proved by Heneghan-Petersen, Power series for up-down min-max permutations, College Math. Journal, Vol. 45, No. 2 (2014), 83-91.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.