Related papers: Subshifts on groups and computable analysis
The dynamics by iteration of a function on a compact metric space, sometimes called a cascade, can be extended to the dynamics of a closed relation on such a space. Here we apply this relation dynamics to study semiflows (and their relation…
In this paper we extend our previous results on the connectivity functions and pressure of the Random Cluster Model in the highly subcritical phase and in the highly supercritical phase, originally proved only on the cubic lattice $\Z^d$,…
Classification is a central problem for dynamical systems, in particular for families that arise in a wide range of topics, like substitution subshifts. It is important to be able to distinguish whether two such subshifts are isomorphic,…
We introduce partially defined dynamical systems defined on a topological space. To each such system we associate a functor $s$ from a category $G$ to $\Top^{\op}$ and show that it defines what we call a skew category algebra $A…
We investigate strictly developable simple complexes of groups with arbitrary local groups, or equivalently, group actions admitting a strict fundamental domain. We introduce a new method for computing the cohomology of such groups. We also…
We study the neutral periodic points of the Markov-Dyck shifts of finite strongly connected directed graphs. Under certain hypothesis on the structure of the graphs we show, that the topological conjugacy of their Markov-Dyck shifts implies…
Dynamical processes can be transformed into graphs through a family of mappings called visibility algorithms, enabling the possibility of (i) making empirical data analysis and signal processing and (ii) characterising classes of dynamical…
In the first part, we concentrate on CFTs in coordinate space. We lay the foundations of Conformal Field Theory and we also demonstrate a method where by using the embedding formalism we can derive up to n-point scalar conformal…
We study metric versions of transitivity, mixing, and hypercyclicity for continuous maps, based on intersections of the form \( f^{n}(U)\cap B_{\delta}(V)\neq\varnothing. \) We introduce $\delta$-topological transitivity,…
Algorithmicists are well-aware that fast dynamic programming algorithms are very often the correct choice when computing on compositional (or even recursive) graphs. Here we initiate the study of how to generalize this folklore intuition to…
Using the combinatorial properties of subsets of integers, a classification of metric dynamical systems was given in [V. Bergelson and T. Downarowicz, Large sets of integers and hierarchy of mixing properties of measure-preserving systems,…
For a finite alphabet $\mathcal{A}$ and shift $X\subseteq\mathcal{A}^{\mathbb{Z}}$ whose factor complexity function grows at most linearly, we study the algebraic properties of the automorphism group ${\rm Aut}(X)$. For such systems, we…
We study finite-dimensional groups definable in models of the theory of real closed fields with a generic derivation (also known as CODF). We prove that any such group definably embeds in a semialgebraic group. We extend the results to…
Let $M$ be a compact surface with boundary. We are interested in the question of how a group action on $M$ permutes a finite invariant set $X \subset int(M)$. More precisely, how the algebraic properties of the induced group of permutations…
We introduce a class of coded systems that we construct from sofic systems and Dyck shifts and we study a class of subshifts that we obtain by excluding words of length two from Dyck shifts. We derive expressions for zeta functions and…
We study, in three parts, degree sequences of k-families (or k-uniform hypergraphs) and shifted k-families. The first part collects for the first time in one place, various implications such as: Threshold implies Uniquely Realizable implies…
This paper provides a systematic study of fundamental combinatorial properties of one-dimensional, two-sided infinite simple Toeplitz subshifts. Explicit formulas for the complexity function, the palindrome complexity function and the…
Many nonlinear dynamical systems exhibit symmetry, affording substantial benefits for control design, observer architecture, and data-driven control. While the classical notion of group invariance enables a cascade decomposition of the…
Understanding the global dynamics of a robot controller, such as identifying attractors and their regions of attraction (RoA), is important for safe deployment and synthesizing more effective hybrid controllers. This paper proposes a…
To study discrete dynamical systems of different types --- deterministic, statistical and quantum --- we develop various approaches. We introduce the concept of a system of discrete relations on an abstract simplicial complex and develop…