相关论文: Ultragraph shift spaces and chaos
We introduce the concept of a 1-coaligned $k$-graph and prove that the shift maps of a $k$-graph pairwise *-commute if and only if the $k$-graph is 1-coaligned. We then prove that for 2-graphs $\Lambda$ generated from basic data *-commuting…
In this paper we provide sufficient conditions in order to show that the set image of a continuous and shift-commuting map defined on a shift space over an arbitrary discrete alphabet is also a shift space; additionally, if such a map is…
A fundamental question in graph theory is to establish conditions that ensure a graph contains certain spanning subgraphs. Two well-known examples are Tutte's theorem on perfect matchings and Dirac's theorem on Hamilton cycles.…
We identify a set of quantum graphs with unique and precisely defined spectral properties called {\it regular quantum graphs}. Although chaotic in their classical limit with positive topological entropy, regular quantum graphs are…
We study chaos and scrambling in unitary channels by considering their entanglement properties as states. Using out-of-time-order correlation functions to diagnose chaos, we characterize the ability of a channel to process quantum…
A sufficient and necessary condition ensuring that the backward shift operator on the K\"{o}the sequence space admits an invariant distributionally $\varepsilon$-scrambled set for some $\varepsilon>0$ is obtained, improving the main results…
In this paper, various chaotic properties and their relationships for interval maps are discussed. It is shown that the proximal relation is an equivalence relation for any zero entropy interval map. The structure of the set of…
We study some basic properties of sofic-Dyck shifts and finite-type-Dyck shifts. We prove that the class of sofic-Dyck shifts is stable under proper conjugacies. We prove a Decomposition Theorem of a proper conjugacy between edge-Dyck…
We give a notion of branching systems on ultragraphs. From this we build concrete representations of ultragraph C*-algebras on the bounded linear operators of Hilbert spaces. To each branching system of an ultragraph we describe the…
Given a dynamical system, we study the so-called space of shift functions thus introducing another vision on bifurcations and chaos. As an application of the obtained results, we give a partial solution to an open problem formulated in…
A $\lambda$-graph system $\frak L$ is a labeled Bratteli diagram with shift operation. It is a generalized notion of finite labeled graph and presents a subshifts. We will study continuous orbit equivalence of one-sided subshifts and…
We study hypercyclicity, Devaney chaos, topological mixing properties and strong mixing in the measure-theoretic sense for operators on topological vector spaces with invariant sets. More precisely, our purpose is to establish links between…
It is proved that positive entropy implies mean Li-Yorke chaos for a G-system, where G is a countable infinite discrete bi-orderable amenable group. Examples are given for the cases of integer lattice groups and groups of integer unipotent…
We classify the gauge-invariant ideals in the C*-algebras of infinite directed graphs, and describe the quotients as graph algebras. We then use these results to identify the gauge-invariant primitive ideals in terms of the structural…
In this paper we analyze the structure of C*-algebras associated to ultragraphs, which are generalizations of directed graphs. We characterize the simple ultragraph algebras as well as deduce necessary and sufficient conditions for an…
In this paper, inspired by the elegant work of Good and Meddaugh \cite{GM} and the graph models for zero-dimensional systems developed by several authors, like Gambaudo and Martens \cite{GM06}, Shimomura \cite{Sh14}. We try to discover a…
We produce a complete descrption of the lattice of gauge-invariant ideals in $C^*(\Lambda)$ for a finitely aligned $k$-graph $\Lambda$. We provide a condition on $\Lambda$ under which every ideal is gauge-invariant. We give conditions on…
Monographs are graph-like structures with directed edges of unlimited length that are freely adjacent to each other. The standard nodes are represented as edges of length zero. They can be drawn in a way consistent with standard graphs and…
Recent work showing the existence of conflict-free almost-perfect hypergraph matchings has found many applications. We show that, assuming certain simple degree and codegree conditions on the hypergraph $ \mathcal{H} $ and the conflicts to…
In this paper we study systems of $N$ uniformly expanding coupled maps when $N$ is finite but large. We introduce self-consistent transfer operators that approximate the evolution of measures under the dynamics, and quantify this…