Related papers: A dynamical characterization of C sets
We define iterated monodromy groups of more general structures than partial self-covering. This generalization makes it possible to define a natural notion of a combinatorial model of an expanding dynamical system. We prove that a naturally…
We introduce notions of vector field and its (discrete time) flow on a chain complex. The resulting dynamical systems theory provides a set of tools with a broad range of applicability that allow, among others, to replace in a canonical way…
Many branches of theoretical and applied mathematics require a quantifiable notion of complexity. One such circumstance is a topological dynamical system - which involves a continuous self-map on a metric space. There are many notions of…
We examine topological dynamical systems on the Cantor set from the point of view of the continuous model theory of commutative C*-algebras. After some general remarks we focus our attention on the generic homeomorphism of the Cantor set,…
The polynomial version of van der Waerden's theorem, proved using dynamical systems by V. Bergelson and A. Leibman in 1996, \cite{Bergelson1996}, significantly highlighted the role of dynamical systems in addressing problems related to…
While compactness is an essential assumption for many results in dynamical systems theory, for many applications the state space is only locally compact. Here we provide a general theory for compactifying such systems, i.e. embedding them…
An existing dialogue between number theory and dynamical systems is advanced. A combinatorial device gives necessary and sufficient conditions for a sequence of non-negative integers to count the periodic points in a dynamical system. This…
The first part of the present article consists in a survey about the dynamical constructive method designed using dynamical theories and dynamical algebraic structures. Dynamical methods uncovers a hidden computational content for numerous…
In analogy with the Fourier-Stieltjes algebra of a group, we associate to a unital discrete twisted C*-dynamical system a Banach algebra whose elements are coefficients of equivariants representations of the system. Building upon our…
Root systems are sets with remarkable symmetries and therefore they appear in many situations in mathematics. Among others, denominator formulae of root systems are very beautiful and mysterious equations which have several meanings from a…
A group may be considered $C^*$-stable if almost representations of the group in a $C^*$-algebra are always close to actual representations. We initiate a systematic study of which discrete groups are $C^*$-stable or only stable with…
We show that the Freiman--Ruzsa theorem, characterising finite sets with bounded doubling, leads to an alternative proof of a characterisation of Meyer sets, that is, relatively dense subsets of Euclidean spaces whose difference sets are…
Soft set theory provides a direct framework for parameterized decision modeling by assigning to each attribute (parameter) a subset of a given universe, thereby representing uncertainty in a structured way [1, 2]. Over the past decades, the…
Some filter relative notions of size, $\left( \mathcal{F},\mathcal{G}\right) $-syndeticity and piecewise $\mathcal{F} $-syndeticity, were defined and applied with clarity and focus by Shuungula, Zelenyuk and Zelenyuk in their paper ``The…
When $\mathcal D$ is strongly self-absorbing we say an inclusion $B \subseteq A$ is $\mathcal D$-stable if it is isomorphic to the inclusion $B \otimes \mathcal D \subseteq A \otimes \mathcal D$. We give ultrapower characterizations and…
In the present paper we study tensor C*-categories with non-simple unit realised as C*-dynamical systems (F,G,\beta) with a compact (non-Abelian) group G and fixed point algebra A := F^G. We consider C*-dynamical systems with minimal…
The theory of dynamical frames evolved from practical problems in dynamical sampling where the initial state of a vector needs to be recovered from the space-time samples of evolutions of the vector. This leads to the investigation of…
We characterize the fixed sets of automorphisms of an arbitrary countable, arithmetically saturated structure.
An aperiodic tile set was first constructed by R. Berger while proving the undecidability of the domino problem. It turned out that aperiodic tile sets appear in many topics ranging from logic (the Entscheidungsproblem) to physics…
A theoretical development is carried to establish fundamental results about rank-initial embeddings and automorphisms of countable non-standard models of set theory, with a keen eye for their sets of fixed points. These results are then…