Asymptotic results on weakly increasing subsequences in random words

DOI10.1016/j.dam.2018.05.043zbMath1401.05014arXiv1706.09510OpenAlexW2963807270WikidataQ129689387 ScholiaQ129689387MaRDI QIDQ1627859

Alperen Y. Özdemir, Ümit Işlak

Publication date: 3 December 2018

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1706.09510

zbMATH Keywords

central limit theoremrandom permutationsmoment asymptoticsrandom wordsweakly increasing subsequences

Mathematics Subject Classification ID

Combinatorics on words (68R15) Permutations, words, matrices (05A05)

Related Items

On an alternative sequence comparison statistic of Steele

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Generalized Galois numbers, inversions, lattice paths, ferrers diagrams and limit theorems
• Convergence rates for generalized descents
• The number of increasing subsequences of the random permutation
• Trailing the dovetail shuffle to its lair
• The combinatorics of biased riffle shuffles
• The number of flags in finite vector spaces: asymptotic normality and Mahonian statistics
• When the law of large numbers fails for increasing subsequences of random permutations
• Normal approximation for nonlinear statistics using a concentration inequality approach
• Law of large numbers for increasing subsequences of random permutations
• Long Common Subsequences and the Proximity of Two Random Strings
• Descent-inversion statistics in riffle shuffles
• A Binomial Identity Arising from a Sorting Problem