Positions of the ranks of factors in certain finite long length words

DOI10.1016/J.SPL.2012.12.005zbMATH Open1270.68234arXiv1201.5937OpenAlexW2019204082MaRDI QIDQ1950712

Elahe Zohoorian Azad

Publication date: 13 May 2013

Published in: Statistics \& Probability Letters (Search for Journal in Brave)

Abstract: We consider the set of finite random words $mathcal{A}^{s}tar$, with independent letters drawn from a finite or infinite totally ordered alphabet according to a general probability distribution. On a specific subset of $mathcal{A}^{s}tar$, considering certain factorization of the words which are labelled with the ranks, base on the lexicographical order, we prove that the normalized position of the ranks of factors, are uniform, when the length of the word goes to infinity.

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

zbMATH Keywords

permutationrankuniform distributionrandom wordfactorized word

Mathematics Subject Classification ID

Combinatorics on words (68R15) Combinatorial probability (60C05)

Recommendations

• Title not available (Why is that?) 👍 👎
• On the number of factors of Sturmian words 👍 👎
• Generalized factorizations of words and their algorithmic properties 👍 👎
• \(\alpha\)-words and factors of characteristic sequences 👍 👎
• Partial words and the critical factorization theorem 👍 👎
• A combinatorial property of the factor poset of a word 👍 👎
• Some results on the number of periodic factors in words 👍 👎
• Partial words and the critical factorization theorem revisited 👍 👎
• MONOCHROMATIC FACTORIZATIONS OF WORDS AND PERIODICITY 👍 👎
• On extended special factors of a word 👍 👎

This page was built for publication: Positions of the ranks of factors in certain finite long length words

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1950712)