Related papers: The K-group of substitutional systems
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…
A finite dynamical system is a system of multivariate functions over a finite alphabet used to model a network of interacting entities. The main feature of a finite dynamical system is its interaction graph, which indicates which local…
For networks of coupled dynamical systems we characterize admissible functions, that is, functions whose gradient is an admissible vector field. The schematic representation of a gradient network dynamical system is of an undirected cell…
We introduce a novel concept in topological dynamics, referred to as $k$-divergence, which extends the notion of divergent orbits. Motivated by questions in the theory of inhomogeneous Diophantine approximations, we investigate this notion…
A linear dynamical system is called $k$-positive if its dynamics maps the set of vectors with up to $k-1$ sign variations to itself. For $k=1$, this reduces to the important class of positive linear systems. Since stable positive linear…
Dynamical systems, whether continuous or discrete, are used by physicists in order to study non-linear phenomena. In the case of discrete dynamical systems, one of the most used is the quadratic map depending on a parameter. However, some…
This note aims to bring attention to a simple class of discrete dynamical systems exhibiting some complex behaviour. Each of these systems is defined as a self-mapping of the unit square and is obtained by coupling two families of…
We describe a procedure to compute the rational nonstable K-groups of A$\mathbb{T}$-algebras. As an application, we show that an A$\mathbb{T}$-algebra is K-stable if and only if it has slow dimension growth.
We develop a formalism for mapping the exact dynamics of an ensemble of disordered quantum systems onto the dynamics of a single particle propagating along a semi-infinite lattice, with parameters determined by the probability distribution…
Understanding the dynamical behavior of complex systems is of exceptional relevance in everyday life, from biology to economy. In order to describe the dynamical organization of complex systems, existing methods require the knowledge of the…
We study one-sided substitution subshifts, and how they can be represented using Bratteli-Vershik systems. In particular we focus on minimal recognizable substitutions such that the generated one-sided substitution subshift contains only…
We give an introduction to the "stable algebra of matrices" as related to certain problems in symbolic dynamics. We consider this stable algebra (especially, shift equivalence and strong shift equivalence) for matrices over general rings as…
Time-continuous dynamical systems defined on graphs are often used to model complex systems with many interacting components in a non-spatial context. In the reverse sense attaching meaningful dynamics to given 'interaction diagrams' is a…
We consider in general terms dynamical systems with finite-dimensional, non-simply connected configuration-spaces. The fundamental group is assumed to be finite. We analyze in full detail those ambiguities in the quantization procedure that…
This work is devoted to giving a geometric framework for describing higher-order non-autonomous mechanical systems. The starting point is to extend the Lagrangian-Hamiltonian unified formalism of Skinner and Rusk for these kinds of systems,…
We study perturbations of random dynamical systems whose associated transfer operators admit a uniform spectral gap. We provide a $k^{\text{th}}$-order approximation for the invariant density of the associated random dynamical system. We…
This paper is a survey of our recent work on operator algebras associated to dynamical systems that lead to classification results for the systems in terms of algebraic invariants of the operator algebras.
In this paper we enumerate $k$-noncrossing tangled-diagrams. A tangled-diagram is a labeled graph whose vertices are $1,...,n$ have degree $\le 2$, and are arranged in increasing order in a horizontal line. Its arcs are drawn in the upper…
The traditional Pi-theorem tells us that for any dimensionally invariant relation there exists a full set of independent dimensionless "Pi groups" which can be used to nondimensionalise the relation. In this paper, we seek to understand…
A category structure for ordered Bratteli diagrams is proposed in which isomorphism coincides with the notion of equivalence of Herman, Putnam, and Skau. It is shown that the natural one-to-one correspondence between the category of Cantor…