A new refinement of Euler numbers on counting alternating permutations
Combinatorics
2020-11-17 v2
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.
Cite
@article{arxiv.1908.00701,
title = {A new refinement of Euler numbers on counting alternating permutations},
author = {Masato Kobayashi},
journal= {arXiv preprint arXiv:1908.00701},
year = {2020}
}
Comments
11 pages, 4 tables