相关论文: The Complexity of Proper Homotopy Equivalence of G…

We are dealing with the complexity of the homeomorphism equivalence relation on some classes of metrizable compacta from the viewpoint of invariant descriptive set theory. We prove that the homeomorphism equivalence relation of absolute…

We show that for any countable homogeneous ordered graph $G$, the conjugacy problem for automorphisms of $G$ is Borel complete. In fact we establish that each such $G$ satisfies a strong extension property called ABAP, which implies that…

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…

The recently introduced A-homotopy groups for graphs are investigated. The main concern of the present article is the construction of an infinite cell complex, the homotopy groups of which are isomorphic to the A-homotopy groups of the…

A neighborhood homotopy is an equivalence relation on spatial graphs which is generated by crossing changes on the same component and neighborhood equivalence. We give a complete classification of all 2-component spatial graphs up to…

We show that the set of locally finite Borel graphs with finite Borel asymptotic dimension is $\mathbf{\Sigma}^1_2$-complete. The result is based on a combinatorial characterization of finite Borel asymptotic dimension for graphs generated…

Graph classification plays an important role is data mining, and various methods have been developed recently for classifying graphs. In this paper, we propose a novel method for graph classification that is based on homotopy equivalence of…

We show that the topological cycle space of a locally finite graph is a canonical quotient of the first singular homology group of its Freudenthal compactification, and we characterize the graphs for which the two coincide. We construct a…

We classify the finite connected-homogeneous digraphs, as well as the infinite such digraphs with precisely one end. This completes the classification of all the locally finite connected-homogeneous digraphs.

We study the complexity of the isomorphism relation for various classes of closed subgroups of the group of permutations of the natural numbers. We use the setting of Borel reducibility between equivalence relations on Polish spaces. For…

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…

Homotopy is an important feature of associative and Jordan algebraic structures: such structures always come in families whose members need not be isomorphic among other, but still share many important properties. One may regard homotopy as…

We consider various equivalence relations on the set of homotopy classes of curves on a hyperbolic surface based on topological, algebraic, and geometric structures. The purpose of this work is to determine the relationship between these…

The {\em perfect matching complex} of a graph is the simplicial complex on the edge set of the graph with facets corresponding to perfect matchings of the graph. This paper studies the perfect matching complexes, $\mathcal{M}_p(H_{k \times…

We characterize the structural impediments to the existence of Borel perfect matchings for acyclic locally countable Borel graphs admitting a Borel selection of finitely many ends from their connected components. In particular, this yields…

The cut pseudo-metric on the space of graph limits induces an equivalence relation. The quotient space obtained by collapsing each equivalence class to a point is a metric space with appealing analytic properties. We show that the…

We propose a homology theory for locally compact spaces with ends in which the ends play a special role. The approach is motivated by results for graphs with ends, where it has been highly successful. But it was unclear how the original…

We give a short, mostly elementary and self-contained proof of the classical result that the groups of diffeomorphisms, homeomorphisms, and homotopy equivalences of a surface have the same group of connected components.

For digital images, there is an established homotopy equivalence relation which parallels that of classical topology. Many classical homotopy equivalence invariants, such as the Euler characteristic and the homology groups, do not remain…

We extend the notion of graph homomorphism to cellularly embedded graphs (maps) by designing operations on vertices and edges that respect the surface topology; we thus obtain the first definition of map homomorphism that preserves both the…