Related papers: Revisiting Leighton's Theorem with the Haar Measur…

We present a novel construction of finite groupoids whose Cayley graphs have large girth even w.r.t. a discounted distance measure that contracts arbitrarily long sequences of edges from the same colour class (sub-groupoid), and only counts…

We show that the geometric and homological finiteness properties of group pairs are invariant under a suitable notion of quasi-isometry for group pairs.

In 1985, Arjeh Cohen and Jacques Tits proved the existence of a 4-cycle-free 2-fold cover of the hypercube. This Cohen-Tits cover is closely related to the signed adjacency matrix that Hao Huang used last year in his proof of the…

We define metric bundles/metric graph bundles which provide a purely topological/coarse-geometric generalization of the notion of trees of metric spaces a la Bestvina-Feighn in the special case that the inclusions of the edge spaces into…

We give elementary proofs of the following two theorems on automorphisms of a finite group G: (1) An automorphism of G is inner if and only if it extends to an automorphism of every finite group containing G. (2) There exists a finite…

We give a technical result that implies a straightforward necessary and sufficient conditions for a graph of groups with virtually cyclic edge groups to be one ended. For arbitrary graphs of groups, we show that if their fundamental group…

We prove the No Invariant Line Fields conjecture for a class of generalized postcritically-finite branched covers on higher-dimensional Riemannian manifolds. Moreover, we establish a quasisymmetric uniformization theorem for this class of…

Let $\Gamma$ be a word hyperbolic group with a cyclic JSJ decomposition that has only rigid vertex groups, which are all fundamental groups of closed surface groups. We show that any group $H$ quasi-isometric to $\Gamma$ is abstractly…

We introduce a notion of curvature on finite, combinatorial graphs. It can be easily computed by solving a linear system of equations. We show that graphs with curvature bounded below by $K>0$ have diameter bounded by $\mbox{diam}(G) \leq…

The theory of graph limits represents large graphs by analytic objects called graphons. Graph limits determined by finitely many graph densities, which are represented by finitely forcible graphons, arise in various scenarios, particularly…

We expound a concise construction of finite groups and groupoids whose Cayley graphs satisfy graded acyclicity requirements. Our acyclicity criteria concern cyclic patterns formed by coset-like configurations w.r.t. subsets of the generator…

We introduce a counterpart to the notion of vertex disjoint tilings by copy of a fixed graph F to the setting of graphons. The case F=K_2 gives the notion of matchings in graphons. We give a transference statement that allows us to switch…

In classical homotopy theory, two spaces are homotopy equivalent if one space can be continuously deformed into the other. This theory, however, does not respect the discrete nature of graphs. For this reason, a discrete homotopy theory…

In this work we prove that, given a simplicial graph $\Gamma$ and a family $\mathcal{G}$ of linear groups over a domain $R$, the graph product $\Gamma\mathcal{G}$ is linear over $R[\underline t]$, where $\underline t$ is a tuple of finitely…

We show that, given a finitely generated group $G$ as the coordinate group of a finite system of equations over a torsion-free hyperbolic group $\Gamma$, there is an algorithm which constructs a cover of a canonical solution diagram. The…

Finite-sheeted covering mappings onto compact connected groups are studied. It is shown that a finite-sheeted covering mapping from a connected Hausdorff topological space onto a compact connected abelian group G must be a homeomorphism…

We extend an old result of de la Harpe and Karoubi, concerning almost representations of compact groups, to proper groupoids admitting continuous Haar measure systems. As an application, we establish the existence of sufficiently many…

A graph $H$ is said to be positive if the homomorphism density $t_H(G)$ is non-negative for all weighted graphs $G$. The positive graph conjecture proposes a characterisation of such graphs, saying that a graph is positive if and only if it…

We consider a coarse version of the marked length spectrum rigidity: given a group with two left invariant metrics, if the marked length spectrum (the translation length function) under the two metrics are the same, then the two metrics are…

A fundamental result in the study of graph homomorphisms is Lov\'asz's theorem that two graphs are isomorphic if and only if they admit the same number of homomorphisms from every graph. A line of work extending Lov\'asz's result to more…