English
Related papers

Related papers: Finite type as fundamental objects even non-single…

200 papers

Inspired by a recent novel work of Good and Meddaugh, we establish fundamental connections between shadowing, finite order shifts, and ultrametric complete spaces. We develop a theory of shifts of finite type for infinite alphabets. We call…

Dynamical Systems · Mathematics 2020-12-29 Udayan B. Darji , Daniel Gonçalves , Marcelo Sobottka

Shifts of finite type and the notion of shadowing, or pseudo-orbit tracing, are powerful tools in the study of dynamical systems. In this paper we prove that there is a deep and fundamental relationship between these two concepts. Let $X$…

Dynamical Systems · Mathematics 2017-02-20 Chris Good , Jonathan Meddaugh

Let $(X,G,\Phi)$ be a dynamical system, where $X$ is compact Hausdorff space, and $G$ is a countable discrete group. We investigate shadowing property and mixing between subshifts and general dynamical systems. For the shadowing property,…

Dynamical Systems · Mathematics 2020-11-18 Zijie Lin , Ercai Chen , Xiaoyao Zhou

We describe structural properties of strongly connected finite directed graphs, that are invariants of the topological conjugacy of their Markov-Dyck shifts. For strongly connected finite directed graphs with these properties topological…

Dynamical Systems · Mathematics 2019-06-11 Toshihiro Hamachi , Wolfgang Krieger

Infinite graphs are finitary in the sense that their points are connected via finite paths. So what would an infinitary generalization of finite graphs look like? Usually this question is answered with the aid of topology, e.g. in the case…

Combinatorics · Mathematics 2020-07-21 Hendrik Heine

A countable, bounded degree graph is almost finite if it has a tiling with isomorphic copies of finitely many F\o lner sets, and we call it strongly almost finite, if the tiling can be randomized so that the probability that a vertex is on…

Group Theory · Mathematics 2025-09-22 Gábor Elek , Ádám Timár

In this paper, we present a constructive and proof-relevant development of graph theory, including the notion of maps, their faces, and maps of graphs embedded in the sphere, in homotopy type theory. This allows us to provide an elementary…

Logic in Computer Science · Computer Science 2024-11-20 Jonathan Prieto-Cubides , Håkon Robbestad Gylterud

In this paper, we study the relationship between the mapping class group of an infinite-type surface and the simultaneous flip graph, a variant of the flip graph for infinite-type surfaces defined by Fossas and Parlier. We show that the…

Geometric Topology · Mathematics 2022-01-28 Assaf Bar-Natan , Advay Goel , Brendan Halstead , Paul Hamrick , Sumedh Shenoy , Rishi Verma

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

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

We show that if a sequence of dense graphs has the property that for every fixed graph F, the density of copies of F in these graphs tends to a limit, then there is a natural ``limit object'', namely a symmetric measurable 2-variable…

Combinatorics · Mathematics 2007-05-23 Laszlo Lovasz , Balazs Szegedy

In this article, we investigate the relationship between the shadowing property of set-valued maps and their associated inverse limit systems. We show that if a set-valued map is expansive and open in the context of set-valued dynamics,…

Dynamical Systems · Mathematics 2025-01-28 Zhengyu Yin

We introduce a taxonomy of interaction types and show that graphs are focal hypergraphs: every graph is canonically a focal hypergraph via its closed neighbourhood structure, and every graph dynamical model is a special case of the general…

Physics and Society · Physics 2026-03-05 Elkaïoum M. Moutuou

Let $E,F$ be two topological spaces and $u:E\rightarrow F$ be a map. \ If $F$ is Haudorff and $u$ is continuous, then its graph is closed. \ \ The Closed Graph Theorem establishes the converse when $E$ and $F$ are suitable objects of…

Functional Analysis · Mathematics 2014-11-21 Henri Bourlès

Bidirected graphs are multigraphs where every edge has an independent direction at each end. In the paper, with an arbitrary bidirected graph we associate a non-negative integral quadratic form (called the incidence form of the graph), and…

Combinatorics · Mathematics 2024-07-09 Jesús Arturo Jiménez González , Andrzej Mróz

The study of very large graphs is a prominent theme in modern-day mathematics. In this paper we develop a rigorous foundation for studying the space of finite labelled graphs and their limits. These limiting objects are naturally countable…

Combinatorics · Mathematics 2021-05-27 Apoorva Khare , Bala Rajaratnam

From the point of view of discrete geometry, the class of locally finite transitive graphs is a wide and important one. The subclass of Cayley graphs is of particular interest, as testifies the development of geometric group theory. Recall…

Combinatorics · Mathematics 2016-12-06 Sébastien Martineau

In this note we make progress toward a conjecture of Durham--Fanoni--Vlamis, showing that every infinite-type surface with finite-invariance index 1 and no nondisplaceable compact subsurfaces fails to have a good curve graph, that is, a…

Geometric Topology · Mathematics 2021-09-16 Justin Lanier , Marissa Loving

We investigate the structure of connected graphs, not necessarily locally finite, with infinitely many ends. On the one hand we study end-transitive such graphs and on the other hand we study such graphs with the property that the…

Combinatorics · Mathematics 2010-03-19 Matthias Hamann

Motivated by the recent work of Algom-Kfir and Bestinva introducing the mapping class group of an infinite graph via proper homotopy equivalences, we give a necessary and sufficient condition for a surface to be properly homotopy equivalent…

Geometric Topology · Mathematics 2024-10-29 Ryan Dickmann , Hannah Hoganson , Sanghoon Kwak
‹ Prev 1 2 3 10 Next ›