A Generalization of Repetition Threshold
组合数学
2007-05-23 v1 离散数学
摘要
Brandenburg and (implicitly) Dejean introduced the concept of repetition threshold: the smallest real number alpha such that there exists an infinite word over a k-letter alphabet that avoids beta-powers for all beta>alpha. We generalize this concept to include the lengths of the avoided words. We give some conjectures supported by numerical evidence and prove one of these conjectures.
引用
@article{arxiv.math/0310144,
title = {A Generalization of Repetition Threshold},
author = {Lucian Ilie and Jeffrey Shallit},
journal= {arXiv preprint arXiv:math/0310144},
year = {2007}
}