Abstract
AbstractIn this paper, we investigate a permutation statistic that was independently introduced by Romik (Funct Anal Appl 39(2):52–155, 2005). This statistic counts the number of bumps that occur during the execution of the Robinson–Schensted procedure when applied to a given permutation. We provide several interpretations of this bump statistic that include the tableaux shape and also as an extremal problem concerning permutations and increasing subsequences. Several aspects of this bump statistic are investigated from both structural and enumerative viewpoints.
Funder
University College Dublin
Publisher
Springer Science and Business Media LLC
Reference14 articles.
1. D. Aldous and P. Diaconis. Longest increasing subsequences: from patience sorting to the Baik-Deift-Johansson theorem. Bull. Amer. Math. Soc. 36 (1999), no.4, 413–432.
2. F. Bergeron. Algebraic Combinatorics and Coinvariant Spaces. CMS Treatises in Mathematics. Canadian Mathematical Society, Ottawa, ON; Wellesley, MA, 2009.
3. M. Bóna. Combinatorics of Permutations. Discrete Mathematics and its Applications, CRC Press, 2012.
4. S. Fomin. Generalized Robinson-Schensted-Knuth correspondence. Zapiski Nauchn. Sem. LOMI 155 (1986), 156–175.
5. E. Gunawan, J. Pan, H.M. Russell, and B.E. Tenner. Runs and RSK tableaux of boolean permutations. Ann. Comb. (2024). https://doi.org/10.1007/s00026-024-00689-z