Nivat's conjecture: Consider 2-dimensional words, that is, sets of letters indexed by Z2. Is the following conjecture true? If the number of distinct m n blocks is at most mn for some m and n, then the word is periodic. Recent results of Van Cyr and Bryna Kra prove the result where the bound mn is replaced by mn/2.

-- JeffreyShallit - 13 Jul 2011

Edit | Attach | Watch | Print version | History: r2 < r1 | Backlinks | Raw View | Raw edit | More topic actions
Topic revision: r2 - 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