Abstract

Word WW is said to encounter word VV provided there is a homomorphism ϕϕ mapping letters to nonempty words so that ϕ(V)ϕ(V) is a substring of WW. For example, taking ϕϕ such that ϕ(h)=cϕ(h)=c and ϕ(u)=ienϕ(u)=ien, we see that "science" encounters "huh" since cienc=ϕ(huh)cienc=ϕ(huh). The density of VV in WW, δ(V,W)δ(V,W), is the proportion of substrings of WW that are homomorphic images of VV. So the density of "huh" in "science" is 2/(82)2/{8 \choose 2}. A word is doubled if every letter that appears in the word appears at least twice. The dichotomy: Let VV be a word over any alphabet, ΣΣ a finite alphabet with at least 2 letters, and Wn∈ΣnW_n \in Σ^n chosen uniformly at random. Word VV is doubled if and only if E(δ(V,Wn))→0\mathbb{E}(δ(V,W_n)) \rightarrow 0 as n→∞n \rightarrow \infty. We further explore convergence for nondoubled words and concentration of the limit distribution for doubled words around its mean.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.