Related papers: Fundamental Groupoids for Graphs
We introduce a notion of quantum function, and develop a compositional framework for finite quantum set theory based on a 2-category of quantum sets and quantum functions. We use this framework to formulate a 2-categorical theory of quantum…
This paper will appear in the Santa Cruz proceedings. An overview of the braid group techniques in the theory of algebraic surfaces, from Zariski to the latest results, is presented. An outline of the Van Kampen algorithm for computing…
We construct a stable infinity category with objects flow categories and morphisms flow bimodules; our construction has many flavors, related to a choice of bordism theory, and we discuss in particular framed bordism and the bordism theory…
If $X$ is a topological group, then its fundamental groupoid $\pi_1X$ is a group-groupoid which is a group object in the category of groupoids. Further if $X$ is a path connected topological group which has a simply connected cover, then…
We prove rigidity properties for von Neumann algebraic graph products. We introduce the notion of rigid graphs and define a class of II$_1$-factors named $\mathcal{C}_{\rm Rigid}$. For von Neumann algebras in this class we show a unique…
We propose to study homomorphisms of connectome graphs. Homomorphisms can be studied as sequences of elementary homomorphisms - folds, which identify pairs of vertices. Several fold types are defined. Initial computation results for some…
In this article we generalize the theory of subgroup graphs of subgroups of free groups to finite index subgroups $H$ of finitely generated groups $G$. We study and prove various properties of $H$ in relation to its subgroup graph…
In this paper we study a new product of graphs called {\em tight product}. A graph $H$ is said to be a tight product of two (undirected multi) graphs $G_1$ and $G_2$, if $V(H)=V(G_1)\times V(G_2)$ and both projection maps $V(H)\to V(G_1)$…
We introduce the notion of a symplectic hopfoid, which is a "groupoid-like" object in the category of symplectic manifolds where morphisms are given by canonical relations. Such groupoid-like objects arise when applying a version of the…
We give a recursion formula to generate all equivalence classes of biconnected graphs with coefficients given by the inverses of the orders of their groups of automorphisms. We give a linear map to produce a connected graph with say, u,…
We show that discrete and classical homotopy theories are equivalent after localizing at n-equivalences for any non-negative integer n. By constructing an explicit homotopy inverse to the graph nerve functor associating an n-fibrant cubical…
This is the first in a series of papers devoted to foundations of topological stacks. We begin developing a homotopy theory for topological stacks along the lines of classical homotopy theory of topological spaces. In this paper we go as…
We express the hairy graph complexes computing the rational homotopy groups of long embeddings (modulo immersion) of R^m in R^n as "decorated" graph complexes associated to certain representations of the outer automorphism groups of free…
We show that the fundamental groupoid~\(\Pi_1(X)\) of a locally path connected semilocally simply connected space~\(X\) can be equipped with a \emph{natural} topology so that it becomes a topological groupoid; we also justify the necessity…
This is a collection of examples showing how the GAP system can be used to compute information about the generating graphs of finite groups. It includes all examples that were needed for the computational results in the paper "Hamiltonian…
The aim of this paper is to present a few versions of the Riemann-Hurwitz formula for a regular branched covering of graphs. By a graph, we mean a finite connected multigraph. The genus of a graph is defined as the rank of the first…
We study an analogue of the classical moment problem in the framework where moments are indexed by graphs instead of natural numbers. We study limit objects of graph sequences where edges are labeled by elements of a topological space.…
Recently, the theory of dense graph limits has received attention from multiple disciplines including graph theory, computer science, statistical physics, probability, statistics, and group theory. In this paper we initiate the study of the…
In \cite{CDD22} we investigated the structure of $\ast$-isomorphisms between von Neumann algebras $L(\Gamma)$ associated with graph product groups $\Gamma$ of flower-shaped graphs and property (T) wreath-like product vertex groups as in…
We define train track maps for graphs-of-groups $\cal G$ and exhibit the precise conditions under which the fundamental finiteness properties known for classical train track maps extend to this generalization. These finiteness properties…