Related papers: To Symbolic Dynamics Through The Thue-Morse Sequen…
The cell complex structure is one of the most fundamental structures in topology and combinatorics, the Morse decomposition of a dynamical system analyzes the global gradient behavior, and the Reeb graph of a function is an elementary tool…
An infinite permutation $\alpha$ is a linear ordering of $\mathbb N$. We study properties of infinite permutations analogous to those of infinite words, and show some resemblances and some differences between permutations and words. In this…
We show that the 2-abelian complexity of the infinite Thue-Morse word is 2-regular, and other properties of the 2-abelian complexity, most notably that it is a concatenation of palindromes of increasing length. We also show sharp bounds for…
Building on the theory of symbolic extensions and uniform generators for discrete transformations we develop a similar theory for topological regular flows. In this context a symbolic extension is given by a suspension flow over a subshift.
We characterize the minimal free resolution of zero-dimensional subschemes in the plane with non connected character. This is then used to slightly generalize a result of Sauer about the smoothability of a.C.M. space curves. Some…
A dual approach to defining the triangle sequence (a type of multidimensional continued fraction algorithm, initially developed in NT/9906016) for a pair of real numbers is presented, providing a new, clean geometric interpretation of the…
In a simple graph, a shunt is a symmetry which sends an edge to an incident edge (without fixing their shared vertex). The orbit of this edge under the shunt forms a consistent cycle. The important theorem of Biggs and Conway says that in a…
A symbolic method for solving linear recurrences of combinatorial and statistical interest is introduced. This method essentially relies on a representation of polynomial sequences as moments of a symbol that looks as the framework of a…
Chaotic attractors, chaotic saddles and periodic orbits are examples of chain-recurrent sets. Using arbitrary small controls, a trajectory starting from any point in a chain-recurrent set can be steered to any other in that set. The…
To investigate the topological structure of Morse functions on the projective plane we use the Reeb graphs. We describe it properties and prove that it is a complete topological invariant of simple Morse function on $\mathbb{R} P^2$. We…
In this work we propose a new type of shift spaces, called blur shift spaces, where one can represent with a single symbol an entire set of infinite symbols. Such shift spaces are constructed from classical shift spaces, by choosing some…
Infinite sequences are of tremendous theoretical and practical importance, and in the Information Age sequences of 0s and 1s are of particular interest. Over the past century, the field of symbolic dynamics has developed to study sequences…
This paper describes new, simple, recursive methods of construction for orientable sequences, i.e. periodic binary sequences in which any n-tuple occurs at most once in a period in either direction. As has been previously described, such…
We apply a symbolic approach of the general quadratic decomposition of polynomial sequences - presented in a previous article referenced herein - to polynomial sequences fulfilling specific orthogonal conditions towards two given…
In this paper we discuss some geometrical and topological properties of the full symmetric Toda system. We show by a direct inspection that the phase transition diagram for the full symmetric Toda system in dimensions $n=3,4$ coincides with…
We study the structure and dynamics of the infinite sequence of extensions of the Poincar{\'e} algebra whose method of construction was described in a previous paper [1]. We give explicitly the Maurer-Cartan (MC) 1-forms of the extended Lie…
Sierpinski's triangle is a fractal and the Prouhet-Thue-Morse word is sufficiently chaotic to avoid cubes. Here we observe that there is at least a tenuous connection between them: the Sierpinski triangle is evident in Pascal's triangle mod…
A new numerical characterization of symbolic sequences is proposed. The partition of sequence based on Ke and Tong algorithm is a starting point. Algorithm decomposes original sequence into set of distinct subsequences - a patterns. The set…
We study a question of Harju from 2019 regarding the existence of infinite ternary square-free words whose subsequences modulo $p$ and $q$ are also square-free for relatively prime integers $p$ and $q$. Among such pairs $(p, q)$ with $p, q…
Morphisms are homomorphisms under the concatenation operation of the set of words over a finite set. Changing the elements of the finite set does not essentially change the morphism. We propose a way to select a unique representing member…