相关论文: On certain labelled directed graphs of symbolic dy…

Complex-valued harmonic functions that are univalent and sense-preserving in the open unit disk are widely studied. A new methodology is employed to construct subclasses of univalent harmonic mappings from a given subfamily of univalent…

In the study of dynamical systems on networks/graphs, a key theme is how the network topology influences stability for steady states or synchronized states. Ideally, one would like to derive conditions for stability or instability that…

The periodic discrete Toda equation defined over finite fields has been studied. We obtained the finite graph structures constructed by the network of states where edges denote possible time evolutions. We simplify the graphs by introducing…

We introduce a persistence-type invariant for finite weighted graphs based on combinatorial multivector dynamics. For each threshold parameter, a relation matrix determines a graph multivector field, whose induced directed dynamics admits a…

This paper introduces an inner product on chain complexes of finite simplicial complexes that is well-adapted to the harmonic study of subdivisions. Its definition utilizes a decomposition of the chain spaces that suggests a sequence of…

In this article we continue the study of automorphism groups of constant length substitution shifts and also their topological factors. We show that up to conjugacy, all roots of the identity map are letter exchanging maps, and all other…

In this paper we study topological invariants of a class of random groups. Namely, we study right angled Artin groups associated to random graphs and investigate their Betti numbers, cohomological dimension and topological complexity. The…

We introduce a class of codes with overlapping code words, that we call SPO-codes. The SPO-codes are related to the Markov codes that were introduced in: G. Keller, J. Combinatorial Theory 56, (1991),pp.\ 75--83. The process of generating a…

We proof here the existence of a topological thick and thin decomposition of any closed definable thick isolated singularity germ in the spirit of the recently discovered metric thick and thin decomposition of complex normal surface…

We give a sufficient geometric condition for a subshift to be measurably isomorphic to a domain exchange and to a translation on a torus. And for an irreducible unit Pisot substitution, we introduce a new topology on the discrete line and…

We consider a two-parameter family of random substitutions and show certain combinatorial and topological properties they satisfy. We establish that they admit recognisable words at every level. As a consequence, we get that the subshifts…

We introduce a new extension in symbolic dynamics on two sets of alphabets, called the zip shift space. In finite case, it represents a finite-to-1 local homeomorphism called zip shift map. Such extension, offers a conjugacy between some…

We introduce the notion of a contractible subshift. This is a strengthening of the notion of strong irreducibility, where we require that the gluings are given by a block map. We show that a subshift is a retract of a full shift if and only…

We show that there exists a class of symbolic subshifts which realizes all Choquet simplices as simplices of invariant measures and the conjugacy relation on that class is hyperfinite.

It is proved that whenever two aperiodic repetitive tilings with finite local complexity have homeomorphic tiling spaces, their associated complexity functions are asymptotically equivalent in a certain sense (which implies, if the…

We introduce a new model of indeterminacy in graphs: instead of specifying all the edges of the graph, the input contains all triples of vertices that form a connected subgraph. In general, different (labelled) graphs may have the same set…

This article is concerned with analytic Hamiltonian dynamical systems in infinite dimension in a neighborhood of an elliptic fixed point. Given a quadratic Hamiltonian, we consider the set of its analytic higher order perturbations. We…

We consider vertex decompositions of (di)graphs which appear in Automata Theory, and establish some their properties. Then we apply them to the problem of forbidden subgraphs.

We use the complexity function of an invariant, not necessary closed, subset of a two-sided shift space to compute the polynomial entropy of the induced dynamics on the hyperspace of continua for certain one-dimensional dynamical systems.…

Without leaving finite mathematics and using finite topological spaces only, we give a definition of homeomorphisms of finite abstract simplicial complexes or finite graphs. Besides exploring the definition in various contexts, we add some…