The most unbalanced words $0^{q-p}1^p$ and majorization
Jetro Vesti

TL;DR
This paper investigates the extremal properties of the words $0^{q-p}1^p$, showing they are the most unbalanced words with maximal partial sum orbit and minimal product, contrasting with balanced words.
Contribution
It establishes the extremal orbit properties of the words $0^{q-p}1^p$, demonstrating their role as the most unbalanced words in terms of partial sum and product.
Findings
Orbit of $0^{q-p}1^p$ is the greatest in partial sum order.
These words have the smallest product among their orbit set.
They are the most unbalanced words with extremal properties.
Abstract
A finite word is balanced if for every equal-length factors and of every cyclic shift of we have . This new class of finite words were defined in [JZ]. In [J], there was proved several results considering finite balanced words and majorization. One of the main results was that the base-2 orbit of the balanced word is the least element in the set of orbits with respect to partial sum. It was also proved that the product of the elements in the base-2 orbit of a word is maximized precisely when the word is balanced. It turns out that the words have similar extremal properties, opposite to the balanced words, which makes it meaningful to call these words the most unbalanced words. This article contains the counterparts of the results mentioned above. We will prove that the orbit of the word is the greatest…
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 · Coding theory and cryptography · Cellular Automata and Applications
