scientific article; zbMATH DE number 1400043
Define the block-complexity of a sequence \(u= (u_{i,j})_{i,j\in \mathbb{Z}}\) with terms in a finite alphabet by \(p(m,n)= \# B_{m,n}\) where \(B_{m,n}\) is the set of rectangular blocks that occur in the sequence \(u\) and have size \(m\times n\). A conjecture of Nivat asserts that if there is an integer pair \((m_0, n_0)\) such that \(p(m_0,n_0)\leq m_0 n_0\), then the sequence \(u\) must admit a nonzero period vector. This conjecture is still open, although a weaker form has been proved recently [\textit{C. Epifanio, M. Koskas} and \textit{F. Mignosi}, On a conjecture on bidimensional words, Preprint, Palermo University, 78 (1999)](This should replace reference[4]). In the paper under review the author studies sequences with complexity \(p(m,n)= mn+1\), \(\forall m,n\). He first shows that these sequences cannot have a nonzero period vector. He then gives a complete characterization of these sequences (very roughly speaking, ``two trivial classes and one Sturmian-related sequence).
- Double sequences of low complexity
- scientific article; zbMATH DE number 6130246
- A set of sequences of complexity \(2n+1\)
- The double sequences
- On the core of double sequences
- On regularly generated double sequences
- scientific article; zbMATH DE number 4036113
- scientific article; zbMATH DE number 3946822
- scientific article; zbMATH DE number 1735419
- The Thue-Morse-Pascal double sequence and similar structures
- A set of sequences of complexity \(2n+1\)
- Plane digitization and related combinatorial problems
- On a conjecture on bidimensional words.
- Local configurations in a discrete plane
- Infinite labeled trees: from rational to Sturmian trees
- Aperiodic two-dimensional words of small abelian complexity
- Maximal pattern complexity of two-dimensional words
- Optimal discovery of repetitions in 2D
- RECURRENT DOUBLE SEQUENCES THAT CAN BE PRODUCED BY CONTEXT-FREE SUBSTITUTIONS
- scientific article; zbMATH DE number 6130246 (Why is no real title available?)
- Nonexpansive \(\mathbb{Z}^{2}\)-subdynamics and Nivat's conjecture
- Double sequences of low complexity
- Strong cocycle triviality for \(Z^{2}\) subshifts
- Periodicity and local complexity
- Indistinguishable asymptotic pairs and multidimensional Sturmian configurations
- \(N\)-factor complexity of the Fibonacci sequence on \(\mathbb{N}\) and the factor-counting sequences
- Recurrence along directions in multidimensional words
- Digital planarity -- a review
- Complexity of short rectangles and periodicity
- Maximal pattern complexity of higher dimensional words
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4939596)