Abstract
The study of the redundancy of non-integer base numeration systems involves several fields of mathematics and of theoretical computer science, including number theory, ergodic theory, topology, and combinatorics on words. When the base is smaller than a sharp value, called critical base, only trivial expansions in a non-integer base are unique, while for greater bases there exist some non-trivial unique expansions. By investigating an unexpected relation between balanced sequences and unique expansions, we explicitly characterize for a large class of three-letter alphabets the minimal unique expansions, namely those unique expansions that first appear when we choose bases larger than the critical base.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
