Related papers: A Closed Graph Theorem for hyperbolic iterated fun…
Building upon [1], this study aims to introduce fractal geometry into graph theory, and to establish a potential theoretical foundation for complex networks. Specifically, we employ the method of substitution to create and explore…
We present two hypermatrix formulations of the Cayley Hamilton theorem. One of the proposed formulation naturally extends to hypermatrices the combinatorial interpretations of the classical Cayley Hamilton theorem. We conclude by discussing…
We apply some methods and technique of complex dynamics to study the set of symmetries of attractors of holomorphic Iterated Function Systems (IFS), as well as relations between IFS sharing the same attractor.
We decide the Borel complexity of the conjugacy problem for automorphism groups of countable homogeneous digraphs. Many of the homogeneous digraphs, as well as several other homogeneous structures, have already been addressed in previous…
On a closed symplectic surface Sigma of genus two or more, we give a new construction of an extended flux map (a crossed homomorphism from the symplectomorphism group Symp(Sigma) to the cohomology group H^1(Sigma;R) that extends the flux…
In this paper we develop a structure called Link Algebra, in which we present a Set with two binary operations and an axiom system developed from the study of graph theory and set/antiset theory, sowing main theorems and definitions. Once…
A simple topological graph $G$ is a graph drawn in the plane so that any pair of edges have at most one point in common, which is either an endpoint or a proper crossing. $G$ is called saturated if no further edge can be added without…
We develop a learning algorithm for closed signal flow graphs - a graphical model of signal transducers. The algorithm relies on the correspondence between closed signal flow graphs and weighted finite automata on a singleton alphabet. We…
Multiparticle systems on complicated metric graphs might have many applications in physics, biology and social life. But the corresponding science still does not exist. Here we start it with simplest examples where there is quadratic…
If a graph is in bridge position in a 3-manifold so that the graph complement is irreducible and boundary irreducible, we generalize a result of Bachman and Schleimer to prove that the complexity of a surface properly embedded in the…
This paper focuses on using the theory of bicorn curves in the context of closed surfaces to understand hyperbolic phenomena of the curve graphs of those surfaces. We prove that the curve graph of any closed surface is 15-hyperbolic with…
Chaotic functions are characterized by sensitivity to initial conditions, transitivity, and regularity. Providing new functions with such properties is a real challenge. This work shows that one can associate with any Boolean network a…
We prove that any diffeomorphism of a compact manifold can be approximated in topology C1 by another diffeomorphism exhibiting a homoclinic bifurcation (a homoclinic tangency or a heterodimensional cycle) or by one which is essentially…
Girth-regular graphs with equal girth, regular degree and chromatic index are studied for the determination of 1-factorizations with each 1-factor intersecting every girth cycle. Applications to hamiltonian decomposability and to…
Periodic surface homemorphisms (diffeomorphisms) play a significant role in the the Nielsen-Thurston classification of surface homeomorphisms. Periodic surface homeomorphisms can be described (up to conjugacy) by using data sets which are…
We investigate dynamical systems obtained by coupling two maps, one of which is chaotic and is exemplified by an Anosov diffeomorphism, and the other is of gradient type and is exemplified by a N-pole-to-S-pole map of the circle. Leveraging…
We prove that Menger's theorem is valid for infinite graphs, in the following strong form: let $A$ and $B$ be two sets of vertices in a possibly infinite digraph. Then there exist a set $\cp$ of disjoint $A$-$B$ paths, and a set $S$ of…
We focus on the algorithm underlying the main result of [A. Mestre, R. Oeckl, Generating loop graphs via Hopf algebra in quantum field theory. J. Math. Phys., 47, 122302, 2006]. This is an algebraic formula to generate all connected graphs…
We call a graph $k$-geodetic, for some $k\geq 1$, if it is connected and between any two vertices there are at most $k$ geodesics. It is shown that any hyperbolic group with a $k$-geodetic Cayley graph is virtually-free. Furthermore, in…
The irreducible complexity of natural phenomena has led Graph Neural Networks to be employed as a standard model to perform representation learning tasks on graph-structured data. While their capacity to capture local and global patterns is…