Related papers: Pullbacks and intersections in categories of graph…

A group $G$ is said to satisfy the finitely generated intersection property (f.g.i.p.) if the intersection of any two finitely generated subgroups of $G$ is again finitely generated. The aim of this article is to understand when the…

Stallings remarked that an outer automorphism of a free group may be thought of as a subdivision of a graph followed by a sequence of folds. In this thesis, we prove that automorphisms of fundamental groups of graphs of groups satisfying…

In differential geometry, the existence of pullbacks is a delicate matter, since the category of smooth manifolds does not admit all of them. When pullbacks are required, often submersions are employed as an ideal class of maps which…

We introduce mappings between spaces of functions on (super)manifolds that generalize pullbacks with respect to smooth maps but are, in general, nonlinear (actually, formal). The construction is based on canonical relations and generating…

Given an Artin group $A_\Gamma$, a common strategy in the study of $A_\Gamma$ is the reduction to parabolic subgroups whose defining graphs have small diameter, i.e. showing that $A_\Gamma$ has a specific property if and only if all "small"…

These notes concern aspects of various graphs whose vertex set is a group $G$ and whose edges reflect group structure in some way (so that they are invariant under the action of the automorphism group of $G$). The graphs I will discuss are…

This article studies automorphism groups of graph products of arbitrary groups. We completely characterise automorphisms that preserve the set of conjugacy classes of vertex groups as those automorphisms that can be decomposed as a product…

We study graph products of groups from the viewpoint of measured group theory. We first establish a full measure equivalence classification of graph products of countably infinite groups over finite simple graphs with no transvection and no…

The subdirect product of two finite groups $A$ and $B$ is defined as a subgroup of the direct product $A \times B$, which is a well-known notion in finite group theory. While it is clear that, under appropriate choices of sets of generators…

For a subset $ S $ of $ \mathbb R^d$, $ S$-graphs are the intersection graphs of specific transformations of $ S $. The class of Burling graphs is a class of triangle-free graphs with arbitrarily large chromatic number that has attracted…

A graph class $\mathcal{G}$ admits product structure if there exists a constant $k$ such that every $G \in \mathcal{G}$ is a subgraph of $H \boxtimes P$ for a path $P$ and some graph $H$ of treewidth $k$. Famously, the class of planar…

We construct an embedding G of the category of graphs into the category of abelian groups such that for graphs X and Y we have Hom(GX,GY)=Z[Hom(X,Y)], the free abelian group whose basis is the set Hom(X,Y). The isomorphism is functorial in…

Span categories provide an abstract framework for formalizing mathematical models of certain systems. The mathematical descriptions of some systems, such as classical mechanical systems, require categories that do not have pullbacks, and…

This paper studies the asymptotic product of two metric spaces. It is well defined if one of the spaces is visual or if both spaces are geodesic. In this case the asymptotic product is the pullback of a limit diagram in the coarse category.…

Random intersection graphs model networks with communities, assuming an underlying bipartite structure of groups and individuals, where these groups may overlap. Group memberships are generated through the bipartite configuration model.…

The semidirect product of a finitely generated group dual with the symmetric group can be described through so-called group-theoretical categories of partitions (covers only a special case; due to Raum--Weber, 2015) and skew categories of…

Let G be a group. The intersection graph G(G) of G is an undirected graph without loops and multiple edges defined as follows: the vertex set is the set of all proper nontrivial subgroups of G; and there is an edge between two distinct…

There has been a great deal of attention recently to graphs whose vertex set is a group, defined using the group structure. (The commuting graph, where two elements are joined if they commute, is the oldest and most famous example.) The…

This paper makes some preliminary observations towards an extension of current work on graphs defined on groups to simplicial complexes. I define a variety of simplicial complexes on a group which are preserved by automorphisms of the…

We introduce a homotopy theory of digraphs (directed graphs) and prove its basic properties, including the relations to the homology theory of digraphs constructed by the authors in previous papers. In particular, we prove the homotopy…