English
Related papers

Related papers: An Alphabetical Approach to Nivat's Conjecture

200 papers

The Morse-Hedlund Theorem states that a bi-infinite sequence $\eta$ in a finite alphabet is periodic if and only if there exists $n\in\N$ such that the block complexity function $P_\eta(n)$ satisfies $P_\eta(n)\leq n$. In dimension two,…

Dynamical Systems · Mathematics 2013-07-02 Van Cyr , Bryna Kra

For a finite alphabet $\A$ and $\eta\colon \Z\to\A$, the Morse-Hedlund Theorem states that $\eta$ is periodic if and only if there exists $n\in\N$ such that the block complexity function $P_\eta(n)$ satisfies $P_\eta(n)\leq n$, and this…

Dynamical Systems · Mathematics 2013-08-26 Van Cyr , Bryna Kra

Nivat's conjecture is a long-standing open combinatorial problem. It concerns two-dimensional configurations, that is, maps $\mathbb Z^2 \rightarrow \mathcal A$ where $\mathcal A$ is a finite set of symbols. Such configurations are often…

Discrete Mathematics · Computer Science 2017-10-17 Michal Szabados

We study Nivat's conjecture on algebraic subshifts and prove that in some of them every low complexity configuration is periodic. This is the case in the Ledrappier subshift (the 3-dot system) and, more generally, in all two-dimensional…

Dynamical Systems · Mathematics 2018-06-20 Jarkko Kari , Etienne Moutot

A celebrated result of Morse and Hedlund, stated in 1938, asserts that a sequence $x$ over a finite alphabet is ultimately periodic if and only if, for some $n$, the number of different factors of length $n$ appearing in $x$ is less than…

Combinatorics · Mathematics 2012-08-06 Fabien Durand , Michel Rigo

We study multidimensional configurations (infinite words) and subshifts of low pattern complexity using tools of algebraic geometry. We express the configuration as a multivariate formal power series over integers and investigate the setup…

Discrete Mathematics · Computer Science 2016-05-20 Jarkko Kari , Michal Szabados

We study multidimensional configurations (infinite words) and subshifts of low pattern complexity using tools of algebraic geometry. We express the configuration as a multivariate formal power series over integers and investigate the setup…

Discrete Mathematics · Computer Science 2015-10-02 Jarkko Kari , Michal Szabados

Nivat's conjecture is a famous open problem in symbolic dynamics. The existence of nonexpansive lines that when endowed with a given orientation are one-sided nonexpansive directions is at the heart of some advances. In his Ph.D. thesis,…

Dynamical Systems · Mathematics 2022-04-15 Cleber Fernando Colle

Let $f_W(n)$ be the number of different factors of length $n$ appearing in $W$. A classical result of Morse and Hedlund, stated in 1938, asserts that an infinite word $W$ is ultimately periodic if and only if $f_W(n)\leq n$ for some $n\in…

Rings and Algebras · Mathematics 2026-05-04 M. A. Khrystik

In this paper, we study the relation between periodicity of two-dimensional words and their abelian pattern complexity. A pattern $\cal{P}$ in $\mathbb{Z}^n$ is the set of all translations of some finite subset $F$ of $\mathbb{Z}^n$. An…

Combinatorics · Mathematics 2021-12-28 Nikolai Geravker , Svetlana Puzynina

Let $A$ be a finite or countable alphabet and let $\theta$ be literal (anti)morphism onto $A^*$ (by definition, such a correspondence is determinated by a permutation of the alphabet). This paper deals with sets which are invariant under…

Discrete Mathematics · Computer Science 2017-07-28 Jean Néraud , Carla Selmi

Let A be a simple, unital, exact, and finite C*-algebra which absorbs the Jiang-Su algebra Z tensorially. We prove that the Cuntz semigroup of A admits a complete order embedding into an ordered semigroup obtained from the Elliott invariant…

Operator Algebras · Mathematics 2007-05-23 Francesc Perera , Andrew S. Toms

In their 1938 seminal paper on symbolic dynamics, Morse and Hedlund proved that every aperiodic infinite word $x\in A^N,$ over a non empty finite alphabet $A,$ contains at least $n+1$ distinct factors of each length $n.$ They further showed…

Combinatorics · Mathematics 2015-05-18 Emilie Charlier , Svetlana Puzynina , Luca Q. Zamboni

We use recent results proved by Berrick and the author (math.KT/0509404) to improve the periodicity theorem in hermitian K-theory. We define also a new filtration of the classical Witt ring W(A), built from non degenerate quadratic forms…

K-Theory and Homology · Mathematics 2007-05-23 Max Karoubi

Eklund et al. (2002) present a graphical technique aimed at simplifying the verification of various category-theoretic constructions, notably the composition of monads. In this note we take a different approach involving string rewriting.…

Logic in Computer Science · Computer Science 2023-06-22 Dexter Kozen

We study a class of maps having the Collatz function (famously related to the Collatz Conjecture) as an example, under the topological and ergodic perspectives, including an approach with thermodynamic formalism. By introducing a key…

Dynamical Systems · Mathematics 2026-03-20 Eduardo Santana

For a (non-unit) Pisot number $\beta$, several collections of tiles are associated with $\beta$-numeration. This includes an aperiodic and a periodic one made of Rauzy fractals, a periodic one induced by the natural extension of the…

Number Theory · Mathematics 2013-10-07 Milton Minervino , Wolfgang Steiner

Let $S$ be a closed Shimura variety uniformized by the complex $n$-ball. The Hodge conjecture predicts that every Hodge class in $H^{2k} (S, \Q)$, $k=0, \ldots, n$, is algebraic. We show that this holds for all degree $k$ away from the…

Algebraic Geometry · Mathematics 2014-06-04 Nicolas Bergeron , John Millson , Colette Moeglin

The Union Closed Sets Conjecture is one of the most renowned problems in combinatorics. Its appeal lies in the simplicity of its statement contrasted with the potential complexity of its resolution. The conjecture posits that, in any union…

Combinatorics · Mathematics 2025-10-02 Nived J M

In this article, we study word equations in free semigroups and the conjecture that the existence of infinitely many solutions entails the existence of solutions with arbitrarily large exponent of periodicity. We examine this question in…

Formal Languages and Automata Theory · Computer Science 2026-02-26 Volker Diekert , Silas Natterer , Alexander Thumm
‹ Prev 1 2 3 10 Next ›