English
Related papers

Related papers: On dynamics of graph maps with zero topological en…

200 papers

In contrast with knots, whose properties depend only on their extrinsic topology in $S^3$, there is a rich interplay between the intrinsic structure of a graph and the extrinsic topology of all embeddings of the graph in $S^3$ . For…

Geometric Topology · Mathematics 2009-06-15 Erica Flapan , Hugh Howards

We have tried to translate some graph properties of AG(R) and Gamma(R) to the topological properties of Zariski topology. We prove that Rad(Gamma(R)) and Rad(AG(R)) are equal and they are equal to 3, if and only if the zero ideal of R is an…

Commutative Algebra · Mathematics 2019-05-14 Mehdi Badie

Let $f:X\to X$ be a continuous map on a compact metric space with finite topological entropy. Further, we assume that the entropy map $\mu\mapsto h_\mu(f)$ is upper semi-continuous. It is well-known that this implies the continuity of the…

Dynamical Systems · Mathematics 2018-03-08 Christian Wolf

We study the dynamical properties of ball expanding maps, a class of continuous self-maps defined on compact metric spaces. For a ball expanding map, we show that: (1) the set of periodic points is dense in the chain recurrent set; (2) if…

Dynamical Systems · Mathematics 2025-08-05 Noriaki Kawaguchi

We analyze the following dynamics on a connected graph $(V,E)$ with $n$ vertices. Let $V = I \bigcup B$, where the set of interior vertices $I \ne \emptyset$ is disjoint from the set of boundary vertices $B \neq \emptyset$. Given $p > 1$…

Probability · Mathematics 2025-12-08 Chenyu Gan , Yuval Peres , Junchi Zuo

Random intersection graphs have received much attention recently and been used in a wide range of applications ranging from key predistribution in wireless sensor networks to modeling social networks. For these graphs, each node is equipped…

Discrete Mathematics · Computer Science 2019-11-06 Jun Zhao , Osman Yagan , Virgil Gligor

It is known that piecewise affine surface homeomorphisms always have measures of maximal entropy. This is easily seen to fail in the discontinuous case. Here we describe a piecewise affine, globally continuous surface map with no measure of…

Dynamical Systems · Mathematics 2009-02-17 Jerome Buzzi

End-periodic homotopy equivalences of infinite, locally finite graphs serve as dimension-one analogs of the end-periodic automorphisms traditionally defined on infinite-type surfaces. We demonstrate that if $\Gamma$ is an infinite graph…

Geometric Topology · Mathematics 2025-11-20 Adam R. Smith

In this paper, it is shown that if a dynamical system is null and distal, then it is equicontinuous. It turns out that a null system with closed proximal relation is mean equicontinuous. As a direct application, it follows that a null…

Dynamical Systems · Mathematics 2021-07-27 Jiahao Qiu , Jianjie Zhao

We consider $2$-colourings $f : E(G) \rightarrow \{ -1 ,1 \}$ of the edges of a graph $G$ with colours $-1$ and $1$ in $\mathbb{Z}$. A subgraph $H$ of $G$ is said to be a zero-sum subgraph of $G$ under $f$ if $f(H) := \sum_{e\in E(H)} f(e)…

Combinatorics · Mathematics 2020-07-17 Yair Caro , Adriana Hansberg , Josef Lauri , Christina Zarb

This paper is an extension of an earlier paper that dealt with global dynamics in autonomous triangular maps. In the current paper, we extend the results on global dynamics of autonomous triangular maps to periodic non-autonomous triangular…

Dynamical Systems · Mathematics 2016-06-01 Rafael Luis

We announce results about flat (linkless) embeddings of graphs in 3-space. A piecewise-linear embedding of a graph in 3-space is called {\it flat} if every circuit of the graph bounds a disk disjoint from the rest of the graph. We have…

Combinatorics · Mathematics 2016-09-06 Neil Robertson , Paul Seymour , Robin Thomas

In this work we establish that finite directed graphs give rise to semiflows on the power set of their nodes. We analyze the topological dynamics for semiflows on finite directed graphs by characterizing Morse decompositions, recurrence…

Dynamical Systems · Mathematics 2020-05-29 José Ayala , Wolfgang Kliemann

Consider a finite connected $2$-complex $X$ endowed with a piecewise Riemannian metric and whose fundamental group is freely indecomposable, of rank at least $3$, and in which every $2$-generated subgroup is free. In this paper we show that…

Differential Geometry · Mathematics 2024-03-25 Florent Balacheff , Wolfgang Pitsch

We derive an algorithm to determine recursively the lap number (minimal number of monotone pieces) of the iterates of unimodal maps of an interval with free end-points. The algorithm is obtained by the sign analysis of the itineraries of…

Chaotic Dynamics · Physics 2016-08-14 Rui Dilão , José Amigó

A $\{0,1\}$-matrix $\mathsf{A}$ is balanced if it does not contain a submatrix of odd order having exactly two 1's per row and per column. A graph is balanced if its clique-matrix is balanced. No characterization of minimally unbalanced…

Discrete Mathematics · Computer Science 2014-06-27 N. Apollonio , A. Galluccio

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…

Dynamical Systems · Mathematics 2026-01-21 Zhengyu Yin

The topological entropy of piecewise affine maps is studied. It is shown that singularities may contribute to the entropy only if there is angular expansion and we bound the entropy via the expansion rates of the map. As a corollary we…

Dynamical Systems · Mathematics 2007-05-23 Boris Kruglikov , Martin Rypdal

We prove that any countable discrete and torsion free subgroup of a general linear group over an arbitrary field or a similar subgroup of an almost connected Lie group satisfies the integral algebraic K-theoretic (split) Novikov conjecture…

K-Theory and Homology · Mathematics 2015-08-05 Snigdhayan Mahanta

The main problem in the area of graph property testing is to understand which graph properties are \emph{testable}, which means that with constantly many queries to any input graph $G$, a tester can decide with good probability whether $G$…

Data Structures and Algorithms · Computer Science 2022-05-04 Louis Esperet , Sergey Norin