Optimizing Properties of Balanced Words
Nikita Sidorov (Manchester, UK)

TL;DR
This paper reviews key results on optimization problems in mathematics that often identify balanced words as optimal solutions, highlighting their significance across various contexts.
Contribution
It compiles and summarizes existing key results related to optimization problems that yield balanced words as optimal solutions.
Findings
Balanced words frequently emerge as optimal solutions in various optimization problems.
The paper provides a comprehensive list of known key results in this area.
Highlights the importance of balanced words in mathematical optimization contexts.
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.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
Topicssemigroups and automata theory · Advanced Algebra and Logic
