Symmetric functions and P-Recursiveness
Journal of Combinatorial Theory Series A
Counting permutations with given cycle structure and descent set
Journal of Combinatorial Theory Series A
SIAM Journal on Mathematical Analysis - Special issue: the articles in this issue are dedicated to Richard Askey and Frank Olver
Doubly alternating Baxter permutations are Catalan
Discrete Mathematics
Combinatorial Enumeration
Fix-Mahonian calculus, I: Two transformations
European Journal of Combinatorics
Permutations with extremal number of fixed points
Journal of Combinatorial Theory Series A
Combinatorics of generalized q-Euler numbers
Journal of Combinatorial Theory Series A
Pattern avoidance for alternating permutations and Young tableaux
Journal of Combinatorial Theory Series A
Permutation Capacities of Families of Oriented Infinite Paths
SIAM Journal on Discrete Mathematics
Foulkes characters, Eulerian idempotents, and an amazing matrix
Journal of Algebraic Combinatorics: An International Journal
Hi-index | 0.00 |
We use the theory of symmetric functions to enumerate various classes of alternating permutations w of {1,2,...,n}. These classes include the following: (1) both w and w^-^1 are alternating, (2) w has certain special shapes, such as (m-1,m-2,...,1), under the RSK algorithm, (3) w has a specified cycle type, and (4) w has a specified number of fixed points. We also enumerate alternating permutations of a multiset. Most of our formulas are umbral expressions where after expanding the expression in powers of a variable E, E^k is interpreted as the Euler number E"k. As a small corollary, we obtain a combinatorial interpretation of the coefficients of an asymptotic expansion appearing in Ramanujan's ''Lost'' Notebook.