English

On cogrowth function of uniformly recurrent sequences

Combinatorics 2020-12-21 v2

Abstract

For a sequence WW we count the number OW(n)O_W(n) of minimal forbidden words no longer then nn and prove that limnOW(n)log3n1.\overline{\lim_{n \to \infty}} \frac{O_W(n)}{\log_3n} \geq 1.

Cite

@article{arxiv.2001.02272,
  title  = {On cogrowth function of uniformly recurrent sequences},
  author = {Igor Melnikov and Ivan Mitrofanov},
  journal= {arXiv preprint arXiv:2001.02272},
  year   = {2020}
}

Comments

an example added, 6 pages

R2 v1 2026-06-23T13:05:26.473Z