Related papers: Train track maps on graphs of groups
This paper gives an introduction to the homotopy theory of quasi-categories. Weak equivalences between quasi-categories are characterized as maps which induce equivalences on a naturally defined system of groupoids. These groupoids…
We address the homotopy theory of 2-crossed modules of commutative algebras, which are equivalent to simplicial commutative algebras with Moore complex of length two. In particular, we construct for maps of 2-crossed modules a homotopy…
Using Lipschitz distance on Outer space we give another proof of the train track theorem.
We investigate properties which ensure that a given finite graph is the commuting graph of a group or semigroup. We show that all graphs on at least two vertices such that no vertex is adjacent to all other vertices is the commuting graph…
We present parity conditions under which a toy rail network is one-way, i.e., whether a direction can be assigned across the network so that all train journeys are completely consistent with it or completely consistent with its opposite. We…
I define a "group graph" which encodes the symmetry in a dynamical process on a network. Group graphs extend signed networks, where links are labelled with plus or minus one, by allowing link labels from any group and generalising the…
In [S. Basu, A. Gabrielov, N. Vorobjov, Semi-monotone sets. arXiv:1004.5047v2 (2011)] we defined semi-monotone sets, as open bounded sets, definable in an o-minimal structure over the reals, and having connected intersections with all…
In this paper, we develop a $\times$-homotopy fundamental groupoid for graphs, and show a functorial relationship to the 2-category of graphs. We further explore the fundamental groupoid of graph products and develop a groupoid product…
We establish an equivalence of homotopy theories between symmetric monoidal bicategories and connective spectra. For this, we develop the theory of $\Gamma$-objects in 2-categories. In the course of the proof we establish strictfication…
Assume that there is a free group action of automorphisms on a bipartite graph. If there is a perfect matching on the factor graph, then obviously there is a perfect matching on the graph. Surprisingly, the reversed is also true for…
We discuss topological versions of the closed graph theorem, where continuity is inferred from near continuity in tandem with suitable conditions on source or target spaces. We seek internal characterizations of spaces satisfying a closed…
For a locally finite, connected graph $\Gamma$, let $\operatorname{Map}(\Gamma)$ denote the group of proper homotopy equivalences of $\Gamma$ up to proper homotopy. Excluding sporadic cases, we show $\operatorname{Aut}(S(M_\Gamma)) \cong…
We consider word maps and word maps with constants on a simple algebraic group. We present results on the images of such maps, in particular, we prove a theorem on the dominance of general word maps with constants, which can be viewed as an…
We describe the relation of $r$-similarity and finite-order invariants on the homotopy set $[S^1,Y]=\pi_1(Y)$.
The homotopy theory of gauge groups has received considerable attention in recent decades. In this work, we study the homotopy theory of gauge groups over some high dimensional manifolds. To be more specific, we study gauge groups of…
A concise discussion of the axiomatic approach to the concept of parallel transport is presented. Attention is drawn to a bijective map between the sets of connections and (axiomatically defined) parallel transports. The transports along…
Twisted diagrams are "diagrams" with components in different categories. Structure maps are defined using auxiliary data which consists of functors relating the various categories to each other. Prime examples of the construction are…
We relativise the Thomassen--Woess definition of accessibility in graphs, defining what it means for a graph to be accessible relative to a peripheral system. In the case of locally finite, quasi-transitive graphs, we characterise relative…
In this paper we develop homotopy theoretical methods for studying diagrams. In particular we explain how to construct homotopy colimits and limits in an arbitrary model category. The key concept we introduce is that of a model…
We defined a grid homology theory for spatial graphs. We showed that the skein exact sequence of singular knots can be extended to our grid homology for spatial graphs.