Related papers: On the Induction Operation for Shift Subspaces and…
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 introduce the Insertion Chain Complex, a higher-dimensional extension of insertion graphs, as a new framework for analyzing finite sets of words. We study its topological and combinatorial properties, in particular its homology groups,…
Semigroups generated by topological operations such as closure, interior or boundary are considered. It is noted that some of these semigroups are in general finite and noncommutative. The problem is formulated whether they are always…
This paper deals with analytic families of holomorphic iterated function systems. Using real analyticity of the pressure function (which we prove), we establish a classification theorem for analytic families of holomorphic iterated function…
In the spirit of topological entropy we introduce new complexity functions for general dynamical systems (namely groups and semigroups acting on closed manifolds) but with an emphasis on the dynamics induced on simplicial complexes. For…
We cast new light on the existing models of one-way deterministic topological automata by introducing a fresh but general, convenient model, in which, as each input symbol is read, an interior system of an automaton, known as a…
In this paper, continuous binary operations of a topological space are studied and a criterion of their invertibility is proved. The classification problem of groups of invertible continuous binary operations of locally compact and locally…
We study a class of $\Z^{d}$-substitutive subshifts, including a large family of constant-length substitutions, and homomorphisms between them, i.e., factors modulo isomorphisms of $\Z^{d}$. We prove that any measurable factor map and even…
A system is invariant with respect to an input transformation if we can transform any dynamic input by this function and obtain the same output dynamics after adjusting the initial conditions appropriately. Often, the set of all such input…
We present an elaboration of inductive definitions down to a universe of datatypes. The universe of datatypes is an internal presentation of strictly positive families within type theory. By elaborating an inductive definition -- a…
We prove that many dynamical properties of group cellular automata (i.e., cellular automata defined on any finite group and with global rule which is an endomorphism), including surjectivity, injectivity, sensitivity to initial conditions,…
The translation of an operator is defined by using conjugation with time-frequency shifts. Thus, one can define $\Lambda$-shift-invariant subspaces of Hilbert-Schmidt operators, finitely generated, with respect to a lattice $\Lambda$ in…
We present a simple discrete model for the non-linear spatial interaction of different kinds of ``subpopulations'' composed of identical moving entities like particles, bacteria, individuals, etc. The model allows to mimic a variety of…
We introduce the notion of induced topological pressure for countable state Markov shifts with respect to a non-negative scaling function and an arbitrary subset of finite words. Firstly, the scaling function allows a direct access to…
We present an intuitive formalism for implementing cellular automata on arbitrary topologies. By that means, we identify a symmetry operation in the class of elementary cellular automata. Moreover, we determine the subset of topologically…
Typically, real-world stochastic processes are not easy to analyze. In this work we study the representation of any stochastic process as a memoryless innovation process triggering a dynamic system. We show that such a representation is…
Causal graph dynamics are transformations over graphs that capture two important symmetries of physics, namely causality and homogeneity. They can be equivalently defined as continuous and translation invariant transformations or functions…
We introduce an operational rewriting-based semantics for strictly positive nested higher-order (co)inductive types. The semantics takes into account the "limits" of infinite reduction sequences. This may be seen as a refinement and…
This paper addresses the problem of checking invariant properties for a large class of symbolic transition systems, defined by a combination of SMT theories and quantifiers. State variables can be functions from an uninterpreted sort…
We consider discrete dynamical systems and lattice models in statistical mechanics from the point of view of their symmetry groups. We describe a C program for symmetry analysis of discrete systems. Among other features, the program…