Skip to main contentSkip to search
Episciences
Open Access Journals
Sign in(new window)
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Sign in(new window)
Articles & Issues
All articlesAll accepted articlesAll volumesLast volumeSectionsSpecial issuesAuthors
About
The journalIndexing
Boards
Publish
For authorsEthical charter
Submit
Discrete Mathematics & Theoretical Computer Science logo
Contact
|
Credits
eISSN 1365-8050
|
RSS
|
Atom
Episciences
Documentation
|
Acknowledgements
|
Publishing policy
Accessibility: non-compliant
|
Legal mentions
|
Privacy statement
|
Terms of use
  1. Home > Articles & Issues >
  2. Articles >
  3. Asymptotic Density o ...
Article

Asymptotic Density of Zimin Words

Joshua Cooper ORCID, Danny Rorabaugh
Download article
Open on arXiv
Imported on
March 17, 2016
Published on
March 17, 2016
Last modified on
March 31, 2025
Volume 18
vol. 18:3
Combinatorics
DOI
10.46298/dmtcs.1302
License
arXiv.org - Non-exclusive license to distribute
Fundação para a Ciência e a Tecnologia, I.P.
PTDC/CCI-BIO/29266/2017
Deep Drug Discovery and Deployment
Indicators
1409
Views
1217
Downloads

Asymptotic Density of Zimin Words

Joshua Cooper ORCID, Danny Rorabaugh
Abstract
Word $W$ is an instance of word $V$ provided there is a homomorphism $\phi$ mapping letters to nonempty words so that $\phi(V) = W$. For example, taking $\phi$ such that $\phi(c)=fr$, $\phi(o)=e$ and $\phi(l)=zer$, we see that "freezer" is an instance of "cool". Let $\mathbb{I}_n(V,[q])$ be the probability that a random length $n$ word on the alphabet $[q] = \{1,2,\cdots q\}$ is an instance of $V$. Having previously shown that $\lim_{n \rightarrow \infty} \mathbb{I}_n(V,[q])$ exists, we now calculate this limit for two Zimin words, $Z_2 = aba$ and $Z_3 = abacaba$. Comment: 25 pages
Keywords
  • Mathematics - Combinatorics
Preview
Loading PDF preview...