相关论文: Characterization and Topological Behavior of Homom…

Topological behavior, such as chaos, irreducibility, and mixing of a one-sided shift of finite type, is well elucidated. Meanwhile, the investigation of multidimensional shifts, for instance, textile systems is difficult and only a few…

We study the topological entropy of hom tree-shifts and show that, although the topological entropy is not a conjugacy invariant for tree-shifts in general, it remains invariant for hom tree higher block shifts. In…

The uncertainty of multidimensional shift spaces draws attracted attention of researchers. For example, the emptiness problem is undecidable; there exist aperiodic shifts of finite type; there is a nonempty shift of finite type exhibiting…

This paper deals with the topological entropy for hom Markov shifts $\mathcal{T}_M$ on $d$-tree. If $M$ is a reducible adjacency matrix with $q$ irreducible components $M_1, \cdots, M_q$, we show that $h(\mathcal{T}_{M})=\max_{1\leq i\leq…

We give a definition of topological entropy for tree shifts, prove that the limit in the definition exists, and show that it dominates the topological entropy of the associated one-dimensional shift of finite type when the labeling of the…

We reveal an algorithm for determining the complete prefix code irreducibility (CPC-irreducibility) of dyadic trees labeled by a finite alphabet. By introducing an extended directed graph representation of tree shift of finite type (TSFT),…

The degree of mixing is a fundamental property of a dynamical system. General multi-dimensional shifts cannot be systematically determined. This work introduces constructive and systematic methods for verifying the degree of mixing, from…

We investigate relations between the pseudo-orbit-tracing property, topological stability and openness for tree-shifts. We prove that a tree-shift is of finite type if and only if it has the pseudo-orbit-tracing property which implies that…

Given a countable group $G$ and two subshifts $X$ and $Y$ over $G$, a continuous, shift-commuting map $\phi : X \to Y$ is called a homomorphism. Our main result states that if every finitely generated subgroup of $G$ has polynomial growth,…

In this paper, we study the independence of shifts defined on $\mathbb{N}^d$ ($\mathbb{N}^d$ shift) and trees (tree-shift). Firstly, for the completeness of the article, we provide a proof that an $\mathbb{N}^d$ shift has positive…

Motivated from the study of multiple ergodic average, the investigation of multiplicative shift spaces has drawn much of interest among researchers. This paper focuses on the relation of topologically mixing properties between…

Topological structures such as the merge tree provide an abstract and succinct representation of scalar fields. They facilitate effective visualization and interactive exploration of feature-rich data. A merge tree captures the topology of…

A homshift is a $d$-dimensional shift of finite type which arises as the space of graph homomorphisms from the grid graph $\mathbb Z^d$ to a finite connected undirected graph $G$. While shifts of finite type are known to be mired by the…

Consider the space of continuous functions on a geometric tree $X$ whose persistent homology gives rise to a finite generic barcode $D$. We show that there are exactly as many path connected components in this space as there are merge trees…

This paper studies the entropy of tree-shifts of finite type with and without boundary conditions. We demonstrate that computing the entropy of a tree-shift of finite type is equivalent to solving a system of nonlinear recurrence equations.…

We study metric versions of transitivity, mixing, and hypercyclicity for continuous maps, based on intersections of the form \( f^{n}(U)\cap B_{\delta}(V)\neq\varnothing. \) We introduce $\delta$-topological transitivity,…

We study extremal properties of finite ultrametric spaces $X$ and related properties of representing trees $T_X$. The notion of weak similarity for such spaces is introduced and related morphisms of labeled rooted trees are found. It is…

In this paper we study several problems concerning the number of homomorphisms of trees. We give an algorithm for the number of homomorphisms from a tree to any graph by the Transfer-matrix method. By using this algorithm and some…

Tree transductions are binary relations of finite trees. For tree transductions defined by non-deterministic top-down tree transducers, inclusion, equivalence and synthesis problems are known to be undecidable. Adding origin semantics to…

In this paper, we present a flexible and probabilistic framework for tracking topological features in time-varying scalar fields using merge trees and partial optimal transport. Merge trees are topological descriptors that record the…