Multidimensional extension of the Morse--Hedlund theorem
Fabien Durand (LAMFA), Michel Rigo

TL;DR
This paper extends the classical Morse--Hedlund theorem from one-dimensional sequences to higher dimensions, characterizing multidimensional sets definable in Presburger arithmetic through recurrence properties.
Contribution
It provides a complete multidimensional extension of the Morse--Hedlund theorem using Presburger definability and recurrence functions.
Findings
Characterization of multidimensional periodicity via recurrence functions
Extension of Morse--Hedlund theorem to arbitrary dimensions
Use of Muchnik's criterion for definability in Presburger arithmetic
Abstract
A celebrated result of Morse and Hedlund, stated in 1938, asserts that a sequence over a finite alphabet is ultimately periodic if and only if, for some , the number of different factors of length appearing in is less than . Attempts to extend this fundamental result, for example, to higher dimensions, have been considered during the last fifteen years. Let . A legitimate extension to a multidimensional setting of the notion of periodicity is to consider sets of definable by a first order formula in the Presburger arithmetic . With this latter notion and using a powerful criterion due to Muchnik, we exhibit a complete extension of the Morse--Hedlund theorem to an arbitrary dimension and characterize sets of definable in in terms of some functions counting recurrent blocks, that is, blocks occurring infinitely often.
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 · Computability, Logic, AI Algorithms · Algorithms and Data Compression
