Related papers: On continuous extension of grafting maps

We generalize the idea of cofinite groups, due to B. Hartley. First we define cofinite spaces in general. Then, as a special situation, we study cofinite graphs and their uniform completions. The idea of constructing a cofinite graph starts…

We show that all residually finite generalized Baumslag-Solitar groups of rank $n \geq 1$, defined on a finite and connected graph, are self-similar. Furthermore we prove that all residually finite fundamental groups of (finite, connected)…

Fractional matching extendability is a concept that brings together two widely studied topics in graph theory, namely that of fractional matchings and that of matching extendability. A {\em fractional matching} of a graph $\Gamma$ with edge…

We show that doubling at some large scale in a Cayley graph implies uniform doubling at all subsequent scales. The proof is based on the structure theorem for approximate subgroups proved by Green, Tao and the first author. We also give a…

We use a version of the Trotter-Kato approximation theorem for strongly continuous semigroups in order to study flows on growing networks. For that reason we use the abstract notion of direct limits in the sense of category theory.

We consider the question of continuity of limit sets for sequences of geometrically finite subgroups of isometry groups of rank-one symmetric spaces, and prove analogues of classical (Kleinian) theorems in this context. In particular we…

We extend the characterization of context-free groups of Muller and Schupp in two ways. We first show that for a quasi-transitive inverse graph $\Gamma$, being quasi-isometric to a tree, or context-free (finitely many end-cones types), or…

We study the uniqueness of optimal solutions to extremal graph theory problems. Lovasz conjectured that every finite feasible set of subgraph density constraints can be extended further by a finite set of density constraints so that the…

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…

Let $G$ be a locally compact group. For every $G$-flow $X$, one can consider the stabilizer map $x \mapsto G_x$, from $X$ to the space $\mathrm{Sub}(G)$ of closed subgroups of $G$. This map is not continuous in general. We prove that if one…

We generalize the notion of quasielliptic curves, which have infinitesimal symmetries and exist only in characteristic two and three, to a remarkable hierarchy of regular curves having infinitesimal symmetries, defined in all…

Metric (graph) bundles generalize the notion of fiber bundles to the context of geometric group theory and were introduced by Mj and Sardar. Suppose $X$ is a metric (graph) bundle over $B$ such that the fibers are (uniformly) hyperbolic,…

The first part of the paper centers in the study of embeddability between partially commutative groups. In [KK], for a finite simplicial graph $\Gamma$, the authors introduce an infinite, locally infinite graph $\Gamma^e$, called the…

We show that every finite group occurs as the automorphism group of infinitely many finite (field) extensions of any given Hilbertian field. This extends and unifies previous results of M. Fried and Takahashi on the global field case.

We develop a new framework for analysing finite connected, oriented graphs of valency 4, which admit a vertex-transitive and edge-transitive group of automorphisms preserving the edge orientation. We identify a sub-family of "basic" graphs…

Let $G$ be a finite group acting transitively on a set $\Omega$. We study what it means for this action to be {\it quasirandom}, thereby generalizing Gowers' study of quasirandomness in groups. We connect this notion of quasirandomness to…

It is established a series of criteria for continuous and homeomorphic extension to the boundary of the so-called lower $Q$-homeomorphisms $f$ between domains in $\overline{\Rn}=\Rn\cup\{\infty\}$, $n\geqslant2$, under integral constraints…

We introduce the notion of continuous orbit equivalence for partial dynamical systems, and give an equivalent characterization in terms of Cartan-isomorphisms for partial C*-crossed products. Both graph C*-algebras and semigroup C*-algebras…

We prove local convergence results for the uniformly random, labelled or unlabelled, graphs from subcritical families. As an example special case, we prove Benjamini-Schramm convergence for the uniform random unlabelled tree. We introduce a…

We prove Bowen's conjecture that every sequence of finite graphs that locally converges to the Cayley graph of a countably infinite group with Kazhdan Property (T) is essentially a vertex-disjoint union of expander graphs. We characterize…