Asymptotic behavior of some factorizations of random words

DOI10.1002/rsa.21073zbMath1523.60023arXiv1004.4062WikidataQ114234628 ScholiaQ114234628MaRDI QIDQ6052484

Elahe Zohoorian Azad, Philippe Chassaing

Publication date: 17 October 2023

Published in: Random Structures & Algorithms (Search for Journal in Brave)

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

zbMATH Keywords

longest runLyndon wordrandom wordPoisson-Dirichlet distributionstandard right factor

Mathematics Subject Classification ID

Central limit and other weak theorems (60F05) Combinatorics on words (68R15) Combinatorial probability (60C05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Some inequalities relating to the partial sum of binomial probabilities
• The origins of combinatorics on words
• Size-biased sampling of Poisson point processes and excursions
• Trailing the dovetail shuffle to its lair
• Counting permutations with given cycle structure and descent set
• Logarithmic combinatorial structures: A probabilistic approach
• The standard factorization of Lyndon words: an average point of view
• Riffle shuffles, cycles, and descents
• Empirical Processes with Applications to Statistics
• Limit Law of the Length of the Standard Right Factor of a Lyndon Word
• On Poisson–Dirichlet Limits for Random Decomposable Combinatorial Structures
• On random polynomials over finite fields
• Factorization in F_q[x and Brownian Motion]
• Order statistics for decomposable combinatorial structures
• Foundations of Modern Probability
• On Burnside's Problem

This page was built for publication: Asymptotic behavior of some factorizations of random words