The multiplicity of left-to-right maxima in geometrically distributed words

References

• Walaa Asakly, Sum of weighted records in set partitions, Discrete Mathematics 344(2) (2021), 112202. ISSN 0012-365X, https://doi.org/10.1016/j.disc.2020.112202.
   Web of Science ®Google Scholar
• C. Banderier, K. Mehlhorn, and R. Beier, Smoothed analysis of three combinatorial algorithms, Mathematical Foundations of Computer Science 2003: 28th International Symposium, Proceedings, Lecture Notes in Computer Science, Vol. 2747, pp. 198–207, Springer, Berlin, 2003.
   Google Scholar
• J.-L. Baril and A. Petrossian, Equivalence classes of permutations modulo descents and left-to-right maxima, Pure Mathematics and Applications 25(1): 19–29, 2015. DOI: https://doi.org/10.1515/puma-2015-0002
   Google Scholar
• N. Cakic, T. Mansour, and R. Smith, Elements protected by records in set partitions, Journal of Difference Equations and Applications 24(12) (2018), 1880–1893. DOI: 10.1080/10236198.2018.1543418
   Web of Science ®Google Scholar
• H-H. Chern and H-K. Hwang, Limit distribution of the number of consecutive records, Random Structures Algorithms 26(4) (2005), 404–417. doi: 10.1002/rsa.20052
   Web of Science ®Google Scholar
• L. Comtet, Advanced Combinatorics, Reidel, Paris, 1974.
   Google Scholar
• V. Damerow, B. Manthey, F.M. Auf Der Heide, H. Racke, C. Scheideler, C. Sohler, and T. Tantau, Smoothed analysis of left-to-right maxima with applications, ACM Transactions on Algorithms 8(3) (2012), Article No. 30. doi: 10.1145/2229163.2229174
   Web of Science ®Google Scholar
• P. Flajolet and R. Sedgewick, Mellin transforms and asymptotics: Finite differences and Rice’s integrals, Theoretical Computer Science 144 (1995), 101–124. doi: 10.1016/0304-3975(94)00281-M
   Web of Science ®Google Scholar
• D. Foata and G-N. Han, Signed words and permutations II: The EulerMahonian polynomials, Electronic Journal of Combinatorics 11(2) (2005), Research Paper 22. doi: 10.37236/1879
   Google Scholar
• M. Fuchs and M. Javanian, Limit behaviour of maxima in geometric words representing set partitions, Applicable Analysis and Discrete Mathematics 9(2) (2015), 313–331. doi: 10.2298/AADM150619013F
   Web of Science ®Google Scholar
• N. Glick, Breaking records and breaking boards, American Mathematical Monthly 85 (1978), 2–26. doi: 10.1080/00029890.1978.11994501
   Web of Science ®Google Scholar
• W. Goh and P. Hitczenko, Gaps in samples of geometric random variables, Discrete Mathematics 307 (2007), 2871– 2890. doi: 10.1016/j.disc.2007.01.013
   Web of Science ®Google Scholar
• R. Kemp, Fundamentals of Average Case Analysis of Particular Algorithms, John Wiley & Sons and B.G. Teubner, Stuttgart, 1984.
   Google Scholar
• E.S. Key, On the number of records in an iid discrete sequence, Journal of Theoretical Probability 18(1) (2005), 99–108. doi: 10.1007/s10959-004-2578-2
   Web of Science ®Google Scholar
• A. Knopfmacher and T. Mansour, Record statistics in a random composition, Discrete Applied Mathematics 160 (2012), 593–603. doi: 10.1016/j.dam.2011.10.025
   Web of Science ®Google Scholar
• A. Knopfmacher, T. Mansour, and S. Wagner, Records in set partitions, Electronic Journal of Combinatorics 17(1) (2010), article R109. doi: 10.37236/381
   Web of Science ®Google Scholar
• D.E. Knuth, The Art of Computer Programming, Vol. 3: Sorting and Searching, Addison-Wesley, Reading, MA, 1998.
   Google Scholar
• I. Kortchemski, Asymptotic behavior of permutation records, Journal of Combinatorial Theory, Series A 116(6) (2009), 1154–1166. https://doi.org/10.1016/j.jcta.2009.03.003
   Web of Science ®Google Scholar
• G. Louchard and H. Prodinger, Asymptotics of the moments of extreme-value related distribution functions, Algorithmica 46 (2006), 437–467. doi: 10.1007/s00453-006-0106-8
   Web of Science ®Google Scholar
• G. Louchard and H. Prodinger, The asymmetric leader election algorithm: Another approach, Annals of Combinatorics 12 (2009), 449–478. doi: 10.1007/s00026-009-0004-2
   Web of Science ®Google Scholar
• A.N. Myers and H.S. Wilf, Left-to-right maxima in words and multiset permutations, Israel Journal of Mathematics 166(1) (2008), 166–183. https://doi.org/10.1007/s11856-008-1026-x
   Web of Science ®Google Scholar
• A. Knopfmacher and H. Prodinger, Combinatorics of geometrically distributed random variables: Value and position of the r-th left-to-right maximum, Discrete Mathematics 226 (2001), 255–267. doi: 10.1016/S0012-365X(00)00133-3
   Web of Science ®Google Scholar
• H. Prodinger, Combinatorics of Geometrically Distributed Random Variables: Left-to-Right Maxima, Discrete Mathematics 153 (1996), 253–270. doi: 10.1016/0012-365X(95)00141-I
   Web of Science ®Google Scholar
• H. Prodinger, Combinatorics of geometrically distributed random variables: Value and position of large left-to-right maxima, Discrete Mathematics 254 (2002), 459–471. doi: 10.1016/S0012-365X(01)00362-4
   Web of Science ®Google Scholar
• H. Prodinger, On the m-enumeration of maximum and left-to-right maxima in geometrically distributed words, Pure Mathematics and Applications 23(2) (2012), 143–154.
   Google Scholar
• A. Rényi, Théorie des éléments saillants d’une suite d’observations, Colloquium on Combinatorial Methods in Probability Theory, Aarhus University, (1962), 104–115.
   Google Scholar
• H.S. Wilf, On the outstanding elements of permutations, 1995, http://www.cis.upenn.edu/wilf.
   Google Scholar
• Y. Yakubovich, On descents after maximal values in samples of discrete random variables, Statistics and Probability Letters 105 (2015), 203–208. doi: 10.1016/j.spl.2015.06.020
   Web of Science ®Google Scholar