References
- A. Blecher, C. Brennan, and A. Knopfmacher, Levels in bargraphs, Ars. Math. Contemp. 9 (2015), pp. 287–300.
- A. Blecher, C. Brennan, and A. Knopfmacher, Combinatorial parameters in bargraphs, Quaest. Math. 39 (2016), pp. 619–635.
- A. Blecher, C. Brennan, and A. Knopfmacher, Peaks in bargraphs, Trans. R. Soc. S. Afr 71 (2016), pp. 97–103.
- A. Blecher, C. Brennan, and A. Knopfmacher, Walls in bargraphs, Online J. Anal. Comb. 12 (2017), pp. 619–635.
- E.R. Canfield, Engel's inequality for Bell numbers, J. Combin. Theory. Ser. A 72 (1995), pp. 184–187.
- N. Glick, Breaking records and breaking boards, Am. Math. Mon. 85 (1978), pp. 2–26.
- A. Knopfmacher, T. Mansour, and S. Wagner, Records in set partitions, Electron. J. Comb. 17 (2010), pp. #R109.
- D.E. Knuth, The Art of Computer Programming, Volume 1, 2nd ed., Addison-Wesley Publishing Co., Reading, MA, 1975.
- I. Kortchemski, Asymptotic behavior of permutation records, J. Comb. Theory. Ser. A 116(6) (2009), pp. 1154–1166.
- M. Javanian, Protected node profile of Tries, Discr. Math. Theor. Comput. Sci. 20(1) (2018.
- T. Mansour, Combinatorics of Set Partitions, Chapman & Hall/CRC, Boca Raton, 2012.
- T. Mansour and M. Shattuck, Bargraph statistics on words and set partitions, J. Diff. Equat. Appl. 23(6) (2017), pp. 1025–1046.
- T. Mansour, M. Shattuck, and S. Wagner, Enumerating set partitions by the number of positions between adjacent occurrences of a letter, Appl. Anal. Discr. Math. 4(2) (2010), pp. 284–308.
- T. Mansour, M. Shattuck, and C. Song, Enumerating set partitions according to the number of descents of size d or more, Proc. Math. Sci. 122(4) (2012), pp. 507–517.
- A. Myers and H. Wilf, Left-to-right maxima in words and multiset permutations, Israel. J. Math. 166 (12008), pp. 167–183.
- A. Rényi, Théorie des éléments saillants d'une suite d'observations, Ann. Fac. Sci. Univ. Clermont-Ferrand 8 (1962), pp. 7–13.