Optimizing Properties of Balanced Words
Discrete Mathematics
2011-08-19 v1 Computational Complexity
Abstract
In the past few decades there has been a good deal of papers which are concerned with optimization problems in different areas of mathematics (along 0-1 words, finite or infinite) and which yield - sometimes quite unexpectedly - balanced words as optimal. In this note we list some key results along these lines known to date.
Cite
@article{arxiv.1108.3639,
title = {Optimizing Properties of Balanced Words},
author = {Nikita Sidorov},
journal= {arXiv preprint arXiv:1108.3639},
year = {2011}
}
Comments
In Proceedings WORDS 2011, arXiv:1108.3412