Density dichotomy in random words
From MaRDI portal
Publication:4634993
zbMATH Open1384.05005arXiv1504.04424MaRDI QIDQ4634993FDOQ4634993
Authors: Danny Rorabaugh, Joshua Cooper
Publication date: 13 April 2018
Abstract: Word is said to encounter word provided there is a homomorphism mapping letters to nonempty words so that is a substring of . For example, taking such that and , we see that "science" encounters "huh" since . The density of in , , is the proportion of substrings of that are homomorphic images of . So the density of "huh" in "science" is . A word is doubled if every letter that appears in the word appears at least twice. The dichotomy: Let be a word over any alphabet, a finite alphabet with at least 2 letters, and chosen uniformly at random. Word is doubled if and only if as . We further explore convergence for nondoubled words and concentration of the limit distribution for doubled words around its mean.
Full work available at URL: https://arxiv.org/abs/1504.04424
Recommendations
Cites Work
- Large networks and graph limits
- Avoidable patterns in strings of symbols
- Title not available (Why is that?)
- New versions of Suen's correlation inequality
- Pattern avoidance: themes and variations
- Exponential lower bounds for the number of words of uniform length avoiding a pattern
- On Unavoidable Sets of Word Patterns
- Strict bounds for pattern avoidance
- Growth problems for avoidable words
- Bounds on Zimin word avoidance
Cited In (1)
Uses Software
This page was built for publication: Density dichotomy in random words
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4634993)