Fraenkel's problem:

A word is balanced if the number of occurrences of any letter in any two factors of equal length differ at most by 1. Given a k-letter alphabet A, with k ≥ 3, is there a unique balanced infinite word with distinct letter frequencies over A? It is known to be true for k ≤ 8.

-- JeffreyShallit - 13 Jul 2011

Edit | Attach | Watch | Print version | History: r3 < r2 < r1 | Backlinks | Raw View | Raw edit | More topic actions
Topic revision: r3 - 2018-02-22 - JeffreyShallit
This site is powered by the TWiki collaboration platform Powered by PerlCopyright © 2008-2024 by the contributing authors. All material on this collaboration platform is the property of the contributing authors.
Ideas, requests, problems regarding TWiki? Send feedback