Related papers: A Closed Graph Theorem for hyperbolic iterated fun…
An isomorphism between two graphs is a bijection between their vertices that preserves the edges. We consider the problem of determining whether two finite undirected weighted graphs are isomorphic, and finding an isomorphism relating them…
The aim of this paper is that of discussing Closed Graph Theorems for bornological vector spaces in a way which is accessible to non-experts. We will see how to easily adapt classical arguments of functional analysis over $\mathbb{R}$ and…
This paper refined and introduced some notations (namely attractors, physical attractors, proper attractors, topologically exact and topologically mixing) within the context of relations. We establish necessary and sufficient conditions,…
In this paper, a function on any pair of graphs is defined whose properties are similar to the properties of dot product in vector space. This function enables us to define graph orthogonality and, also, a new metric on isomorphism classes…
In the branch of mathematics known as graph theory, graphs are considered as a set of points, called vertices, with connections between these points, called edges. The purpose of this paper is to study mappings between two graphs that have…
This paper deals with analytic families of holomorphic iterated function systems. Using real analyticity of the pressure function (which we prove), we establish a classification theorem for analytic families of holomorphic iterated function…
The fine curve graph was introduced to study homeomorphism group of surfaces. In this paper we study the topology of the Gromov boundary of this graph for closed surfaces with higher genus. We first prove a bounded geodesic image theorem…
Graphs are fundamental objects that find widespread applications across computer science and beyond. Graph Theory has yielded deep insights about structural properties of various families of graphs, which are leveraged in the design and…
We offer a new perspective on the closed graph theorem and the open mapping theorem for separated barrelled spaces and fully complete spaces.
We prove a topological rigidity result for simple, thick, hyperbolic P-manifolds of dimension 2: isomorphism of the fundamental groups implies homeomorphism of the P-manifolds. An immediate application is a diagram rigidity theorem for…
The two main theorems of this paper provide a characterization of hyperbolic affine iterated function systems defined on Rm. Atsushi Kameyama (Distances on Topological Self-Similar Sets, Proceedings of Symposia in Pure Mathematics, Volume…
In this paper we resolve the complexity of the isomorphism problem on all but finitely many of the graph classes characterized by two forbidden induced subgraphs. To this end we develop new techniques applicable for the structural and…
Guided by classical concepts, we define the notion of \emph{ends} of an iterated function system and prove that the number of ends is an upper bound for the number of nondegenerate components of its attractor. The remaining isolated points…
Whitney's 2-Isomorphism Theorem characterises when two graphs have isomorphic cycle matroids. We present an analogue of this theorem for graphs embedded in surfaces by characterising when two graphs in surface have isomorphic…
Determining whether two graphs are structurally identical is a fundamental problem with applications spanning mathematics, computer science, chemistry, and network science. Despite decades of study, graph isomorphism remains a challenging…
A theory graph is a network of axiomatic theories connected with meaning-preserving mappings called theory morphisms. Theory graphs are well suited for organizing large bodies of mathematical knowledge. Traditional and formal proofs do not…
We study the topological properties of attractors of Iterated Function Systems (I.F.S.) on the real line, consisting of affine maps of homogeneous contraction ratio. These maps define what we call a second generation I.F.S.: they are…
We investigate oriented graphs based on the curve complex $C(S)$ of a closed surface $S$ and induced by functions on the vertex set of $C(S)$. In particular, we introduce the Dehn quasi-homothetic functions, which behave similarly to…
In this note we prove that every closed graph $G$ is up to isomorphism a proper interval graph. As a consequence we obtain that there exist linear-time algorithms for closed graph recognition.
The aim of this paper is to give a condition to topological conjugacy of invariant flows in an Lie group $G$ which its Lie algebra $\mathfrak{g}$ is associative algebra or semisimple. In fact, we show that if two dynamical system on $G$ are…