Abstract
In this paper we give a bijection between the class of permutations that can be drawn on an X-shape and a certain set of permutations that appears in Knuth [4] in connection to sorting algorithms. A natural generalization of this set leads us to the definition of almost-increasing permutations, which is a one-parameter family of permutations that can be characterized in terms of forbidden patterns. We find generating functions for almost-increasing permutations by using their cycle structure to map them to colored Motzkin paths. We also give refined enumerations with respect to the number of cycles, fixed points, excedances, and inversions.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Atkinson M.D.: Some equinumerous pattern-avoiding classes of permutations. Discrete Math. Theor. Comput. Sci. 7(1), 71–73 (2005)
Flajolet P.: Combinatorial aspects of continued fractions. Discrete Math. 306(10-11), 992–1021 (2006)
Foata D., Schützenberger M.-P.: Théorie géométrique des polynômes Eulériens. Springer, Berlin (1970)
Knuth D.: The Art of Computer Programming, Vol. III. Addison-Wesley, Reading, MA (1973)
Waton S. (2007) On permutation classes defined by token passing networks, gridding matrices and pictures: three flavours of involvement. Ph.D. thesis. University of St Andrews, St Andrews
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
About this article
Cite this article
Elizalde, S. The X-Class and Almost-Increasing Permutations. Ann. Comb. 15, 51–68 (2011). https://doi.org/10.1007/s00026-011-0082-9
Received:
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00026-011-0082-9