2000 character limit reached
A new refinement of Euler numbers on counting alternating permutations
Published 2 Aug 2019 in math.CO | (1908.00701v2)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.