Access

You are not currently logged in.

Access your personal account or get JSTOR access through your library or other institution:

login

Log in to your personal account or through your institution.

Power Series for Up-Down Min-Max Permutations

Fiacha Heneghan and Kyle Petersen
The College Mathematics Journal
Vol. 45, No. 2 (March 2014), pp. 83-91
DOI: 10.4169/college.math.j.45.2.083
Stable URL: http://www.jstor.org/stable/10.4169/college.math.j.45.2.083
Page Count: 9
  • Download ($16.00)
  • Cite this Item
Item Type
Article
References
Power Series for Up-Down Min-Max Permutations
Preview not available

Abstract

Summary Calculus and combinatorics overlap, in that power series can be used to study combinatorially defined sequences. In this paper, we use exponential generating functions to study a curious refinement of the Euler numbers, which count the number of “up-down” permutations of length n.

Page Thumbnails