Related papers: Finite type as fundamental objects even non-single…
An analog of Kreimer's coproduct from renormalization of Feynman integrals in quantum field theory, endows an analog of Kontsevich's graph complex with a dg-coalgebra structure. The graph complex is generated by orientation classes of…
We study infinite graph-directed iterated function systems (GIFS) whose underlying graph is not strongly connected and has countably many vertices and edges. In addition to a summability condition for the physical potential, we provide…
Leavitt inverse semigroups of directed finite graphs are related to Leavitt graph algebras of (directed) graphs. Leavitt path algebras of graphs have the natural $\mathbb Z$-grading via the length of paths in graphs. We consider the…
In recent work, the authors developed a simple method of constructing topological spaces from certain well-behaved partially ordered sets -- those coming from sequences of relations between finite sets. This method associates a given poset…
The classical Hausdorff dimension of finite or countable metric spaces is zero. Recently, we defined a variant, called \emph{finite Hausdorff dimension}, which is not necessarily trivial on finite metric spaces. In this paper we apply this…
We introduce and study asymptotically rigid mapping class groups of certain infinite graphs. We determine their finiteness properties and show that these depend on the number of ends of the underlying graph. In a special case where the…
An approach to find a weak form of shadowing is developed. We consider homeomorphisms of a compact metric space. It is proved that every pseudotrajectory with sufficiently small errors contains at least one subsequence that can be shadowed…
Building upon previous works of Proudfoot and Ramos, and using the categorical framework of Sam and Snowden, we extend the weak categorical minor theorem from undirected graphs to quivers. As case of study, we investigate the consequences…
We introduce a notion of graph homeomorphisms which uses the concept of dimension and homotopy for graphs. It preserves the dimension of a subbasis, cohomology and Euler characteristic. Connectivity and homotopy look as in classical…
We extend the characterization of context-free groups of Muller and Schupp in two ways. We first show that for a quasi-transitive inverse graph $\Gamma$, being quasi-isometric to a tree, or context-free (finitely many end-cones types), or…
We show that for most pairs of surfaces, there exists a finite subgraph of the flip graph of the first surface so that any injective homomorphism of this finite subgraph into the flip graph of the second surface can be extended uniquely to…
We study the metric dimension (strong and weak) of infinite graphs. In particular, our main interest is characterizing infinite graphs with finite dimension. Our main results: (1) graphs with more than one end have infinite strong…
If $R$ is a commutative ring, $M$ a compact $R$-oriented manifold and $G$ a finite graph without loops or multiple edges, we consider the graph configuration space $M^G$ and a Bendersky-Gitler type spectral sequence converging to the…
We develop a formalism to address statistical pattern recognition of graph valued data. Of particular interest is the case of all graphs having the same number of uniquely labeled vertices. When the vertex labels are latent, such graphs are…
A digraph is connected-homogeneous if any isomorphism between finite connected induced subdigraphs extends to an automorphism of the digraph. We consider locally-finite connected-homogeneous digraphs with more than one end. In the case that…
Aiming at a better understanding of finite groups as finite dynamical systems, we show that by a version of Fitting's Lemma for groups, each state space of an endomorphism of a finite group is a graph tensor product of a finite directed…
We discuss whether classical examples of dynamical systems satisfying the shadowing property also satisfy the shadowing property for the induced map on the hyperspace of continua, obtaining both positive and negative results. We prove that…
Following a general program of studying limits of discrete structures, and motivated by the theory of limit objects of converge sequences of dense simple graphs, we study the limit of graph sequences such that every edge is labeled by an…
A rational map $f:\widehat{\mathbb{C}}\to\widehat{\mathbb{C}}$ on the Riemann sphere $\widehat{\mathbb{C}}$ is called critically fixed if each critical point of $f$ is fixed under $f$. In this article, we study the properties of a…
Given an infinite graph $G$ on countably many vertices, and a closed, infinite set $\Lambda$ of real numbers, we prove the existence of an unbounded self-adjoint operator whose graph is $G$ and whose spectrum is $\Lambda$.