Related papers: Topological Dynamics indexed by words
Topologies on algebraic and equational theories are used to define germ determined, near-point determined, and point determined rings of smooth functions, without requiring them to be finitely generated. It is proved, that any commutative…
The periodic (ordinal) patterns of a map are the permutations realized by the relative order of the points in its periodic orbits. We give a combinatorial characterization of the periodic patterns of an arbitrary signed shift, in terms of…
Deterministic many-body systems governed by simple interactions can self-organize into macroscopic patterns, and the determinants of long-time behavior are assumed to be encoded in the initial configuration. Here we show that predictability…
A major achievement in the study of complex networks is the observation that diverse systems, from sub-cellular biology to social networks, exhibit universal topological characteristics. Yet this universality does not naturally translate to…
A number of researchers have introduced topological structures on the set of laws of stochastic processes. A unifying goal of these authors is to strengthen the usual weak topology in order to adequately capture the temporal structure of…
This article surveys the burgeoning area at the intersection of dynamical systems theory and algorithms for NP-hard problems. Traditionally, computational complexity and the analysis of non-deterministic polynomial-time (NP)-hard problems…
We consider the category of partially observable dynamical systems, to which the entropy theory of dynamical systems extends functorially. This leads us to introduce quotient-topological entropy. We discuss the structure that emerges. We…
We adapt the definition of the Vietoris map to the framework of finite topological spaces and we prove some coincidence theorems. From them, we deduce a Lefschetz fixed point theorem for multivalued maps that improves recent results in the…
We consider extensions of the language of Peano arithmetic by transfinitely iterated truth definitions satisfying uniform Tarskian biconditionals. Without further axioms, such theories are known to be conservative extensions of the original…
We present a new recursive generation algorithm for prefix normal words. These are binary strings with the property that no substring has more 1s than the prefix of the same length. The new algorithm uses two operations on binary strings,…
The dynamics of certain combinatorial actions and their liftings to actions at the piecewise-linear and birational level have been studied lately with an eye towards questions of periodicity, orbit structure, and invariants. One key…
In this work, we explore the state-space formulation of a network process to recover, from partial observations, the underlying network topology that drives its dynamics. To do so, we employ subspace techniques borrowed from system…
We continue the study of non-invertible topological dynamical systems with expanding behavior. We introduce the class of {\em finite type} systems which are characterized by the condition that, up to rescaling and uniformly bounded…
Inflection graphs are highly complex networks representing relationships between inflectional forms of words in human languages. For so-called synthetic languages, such as Latin or Polish, they have particularly interesting structure due to…
Categories of partitions are combinatorial structures arising from the representation theory of certain compact quantum groups and are linked to classical diagram algebras such as the Temperley-Lieb algebra. In this paper, we present…
A class of random discrete distributions $P$ is introduced by means of a recursive splitting of unity. Assuming supercritical branching, we show that for partitions induced by sampling from such $P$ a power growth of the number of blocks is…
We first consider the Hamiltonian formulation of $n=3$ systems in general and show that all dynamical systems in ${\mathbb R}^3$ are bi-Hamiltonian. An algorithm is introduced to obtain Poisson structures of a given dynamical system. We…
We consider the four fragments FO2, the intersection of Sigma2 and FO2, the intersection of Pi2 and FO2, and Delta2 of first-order logic FO[<] over finite and infinite words. For all four fragments, we give characterizations in terms of…
We develop Conley's theory for multivalued maps on finite topological spaces. More precisely, for discrete-time dynamical systems generated by the iteration of a multivalued map which satisfies appropriate regularity conditions, we…
A (closed) dynamical system is a notion of how things can be, together with a notion of how they may change given how they are. The idea and mathematics of closed dynamical systems has proven incredibly useful in those sciences that can…