English
Related papers

Related papers: Bratteli--Vershik models and graph covering models

200 papers

Graph covers are a way to describe continuous maps (and homeomorphisms) of a Cantor set, more generally than e.g.\ Bratteli-Vershik systems. Every continuous map on a zero-dimensional compact set can be expressed by a graph cover (e.g.\…

Dynamical Systems · Mathematics 2024-09-24 Jan Boroński , Henk Bruin , Przemysław Kucharski

Bratteli--Vershik systems have been widely studied. In the context of general 0-dimensional systems, Bratteli--Vershik systems are homeomorphisms that have Kakutani--Rohlin refinements. Bratteli diagram has a strong power to analyze such…

Dynamical Systems · Mathematics 2015-06-23 Takashi Shimomura

Separated graphs provide a powerful combinatorial tool for approximating dynamical systems. This paper details the explicit construction of Bratteli-like separated graphs -- a generalization of classical Bratteli diagrams -- that encode the…

Dynamical Systems · Mathematics 2026-03-17 Joan Claramunt

The goal of this paper is to put together several techniques in handling dynamical systems on zero-dimensional spaces, such as array representation, inverse limit representation, or Bratteli-Vershik representation. We describe how one can…

Dynamical Systems · Mathematics 2016-12-07 Tomasz Downarowicz , Olena Karpel

We study substitutions on countably infinite alphabet (without compactification) as Borel dynamical systems. We construct stationary and non-stationary generalized Bratteli-Vershik models for a class of such substitutions, known as left…

Dynamical Systems · Mathematics 2024-03-07 Sergey Bezuglyi , Palle E. T. Jorgensen , Shrey Sanadhya

Bratteli-Vershik models have been very successfully applied to the study of various dynamical systems, in particular, in Cantor dynamics. In this paper, we study dynamics on the path spaces of generalized Bratteli diagrams that form models…

Dynamical Systems · Mathematics 2023-07-14 Sergey Bezuglyi , Palle E. T. Jorgensen , Olena Karpel , Shrey Sanadhya

$\lambda$-graph systems are labeled Bratteli diagram with shift operations. They present subshifts. Their matrix presentations are called symbolic matrix systems. We define skew products of $\lambda$-graph systems and study extensions of…

Dynamical Systems · Mathematics 2016-05-03 Kengo Matsumoto

We present a graph-theoretic model for dynamical systems $(X,\sigma)$ given by a surjective local homeomorphism $\sigma$ on a totally disconnected compact metrizable space $X$. In order to make the dynamics appear explicitly in the graph,…

Operator Algebras · Mathematics 2024-02-13 Pere Ara , Joan Claramunt

In the zero-dimensional systems, the Bratteli-Vershik models can be built upon certain closed sets that are called `quasi-sections' in this article. There exists a bijective correspondence between the topological conjugacy classes of…

Dynamical Systems · Mathematics 2024-01-01 Takashi Shimomura

In the paper we study aperiodic substitutional dynamical systems arisen from non-primitive substitutions. We prove that the Vershik homeomorphism $\phi$ of a stationary ordered Bratteli diagram is homeomorphic to an aperiodic substitutional…

Dynamical Systems · Mathematics 2007-05-29 S. Bezuglyi , J. Kwiatkowski , K. Medynets

The explosion of data available in life sciences is fueling an increasing demand for expressive models and computational methods. Graph transformation is a model for dynamic systems with a large variety of applications. We introduce a novel…

We develop conditions for the coding of a Bratteli-Vershik system according to initial path segments to be periodic, equivalently for a constructive symbolic recursive scheme corresponding to a cutting and stacking process to produce a…

Dynamical Systems · Mathematics 2020-03-16 Sarah Frick , Karl Petersen , Sandi Shields

We study stationary ordered Bratteli diagrams and give necessary and sufficient conditions for these orders to generate a continuous Vershik map. We apply this to finding adic representations for one sided substitution subshifts. We give an…

Dynamical Systems · Mathematics 2011-06-29 Reem Yassawi

We consider general integrable systems on graphs as discrete flat connections with the values in loop groups. We argue that a certain class of graphs is of a special importance in this respect, namely quad-graphs, the cellular…

Exactly Solvable and Integrable Systems · Physics 2007-05-23 Alexander I. Bobenko , Yuri B. Suris

The notion of a contractible transformation on a graph was introduced by Ivashchenko as a means to study molecular spaces arising from digital topology and computer image analysis, and more recently has been applied to topological data…

The classic technique of Baker [J. ACM '94] is the most fundamental approach for designing approximation schemes on planar, or more generally topologically-constrained graphs, and it has been applied in a myriad of different variants and…

Data Structures and Algorithms · Computer Science 2023-11-01 Tuukka Korhonen , Wojciech Nadara , Michał Pilipczuk , Marek Sokołowski

We give a characterization of isomorphisms between Schreier graphs in terms of the groups, subgroups and generating systems. This characterization may be thought as a graph analog of Mostow's rigidity theorem for hyperbolic manifolds. This…

Combinatorics · Mathematics 2025-04-02 Paul-Henry Leemann

We introduce a new class of partial actions of free groups on totally disconnected compact Hausdorff spaces, which we call convex subshifts. These serve as an abstract framework for the partial actions associated with finite separated…

Operator Algebras · Mathematics 2017-05-15 Pere Ara , Matias Lolk

We study the basic relation between skew-symmetric Lotka-Volterra systems and graphs, both at the level of objects and morphisms, and derive a classification from it of skew-symmetric Lotka-Volterra systems in terms of graphs as well as in…

Mathematical Physics · Physics 2020-11-02 Charalampos Evripidou , Pavlos Kassotakis , Pol Vanhaecke

The present paper explores substitution minimal systems and their relation to stationary Bratteli diagrams and stationary dimension groups. The constructions involved are algorithmic and explicit, and render an effective method to compute…

Dynamical Systems · Mathematics 2008-07-24 Fabien Durand , Bernard Host , Christian Skau
‹ Prev 1 2 3 10 Next ›