Related papers: Connectivity Properties for Actions on Locally Fin…

We deduce from Sageev's results that whenever a group acts locally elliptically on a finite dimensional CAT(0) cube complex, then it must fix a point. As an application, we give an example of a group G such that G does not have property…

Given a group $G$, we define the power graph $\mathcal{P}(G)$ as follows: the vertices are the elements of $G$ and two vertices $x$ and $y$ are joined by an edge if $\langle x \rangle \subseteq \langle y \rangle$ or $\langle y \rangle…

Let Gamma be a finitely generated, amenable group. Using an idea of E Ghys, we prove that if Gamma has a nontrivial, orientation-preserving action on the real line, then Gamma has an infinite, cyclic quotient. (The converse is obvious.)…

We prove that every graph which admits a tree-decomposition into finite parts has a rooted tree-decomposition into finite parts that is linked, tight and componental. As an application, we obtain that every graph without half-grid minor has…

We consider matrices with entries in a local ring, Mat(m,n;R). Fix an action of group G on Mat(m,n;R), and a subset of allowed deformations, \Sigma in Mat(m,n;R). The standard question (along the lines of Singularity Theory) is the…

In this paper we study CAT(0) groups and their splittings as graphs of groups. For one-ended CAT(0) groups with isolated flats we prove a theorem characterizing exactly when the visual boundary is locally connected. This characterization…

This paper applies the decomposition theorem in intersection cohomology to geometric invariant theory quotients, relating the intersection cohomology of the quotient to that of the semistable points for the action. Suppose a connected…

An action of a group $G$ is highly transitive if $G$ acts transitively on $k$-tuples of distinct points for all $k \geq 1$. Many examples of groups with a rich geometric or dynamical action admit highly transitive actions. We prove that if…

We give a unified approach to analysing, for each positive integer $s$, a class of finite connected graphs that contains all the distance transitive graphs as well as the locally $s$-arc transitive graphs of diameter at least $s$. A graph…

We prove two characterisations of accessibility of locally finite quasi-transitive connected graphs. First, we prove that any such graph $G$ is accessible if and only if its set of separations of finite order is an ${\rm Aut}(G)$-finitely…

Given a partial action of a topological group $G$ on a space $X$, we determine properties $\mathcal P$ which can be extended from $X$ to its globalization. We treat the cases when $\mathcal P$ is any of the following: Hausdorff, regular,…

Let $G$ be the group of orientation-preserving isometries of a rank-one symmetric space $X$ of non-compact type. We study local rigidity of certain actions of a solvable subgroup $\Gamma \subset G$ on the boundary of $X$, which is…

This paper generalizes Bass' work on zeta functions for uniform tree lattices. Using the theory of von Neumann algebras, machinery is developed to define the zeta function of a discrete group of automorphisms of a bounded degree tree. The…

The goal of this paper is to provide a general purpose result for the coupling of exploration processes of random graphs, both undirected and directed, with their local weak limits when this limit is a marked Galton-Watson process. This…

We consider actions of completely metrisable groups on simplicial trees in the context of the Bass--Serre theory. Our main result characterises continuity of the amplitude function corresponding to a given action. Under fairly mild…

We introduce the notion of a ``sofic $\mathcal{C}$-action'' of one group on another by automorphisms, for $\mathcal{C}$ a class of groups. We show that if $\mathcal{C}$ is the class of (i) sofic, (ii) hyperlinear, (iii) linear sofic or (iv)…

We study marginally compact macromolecular trees that are created by means of two different fractal generators. In doing so, we assume Gaussian statistics for the vectors connecting nodes of the trees. Moreover, we introduce bond-bond…

We prove a structural result for orientation-preserving actions of finitely generated solvable groups on real intervals, considered up to semi-conjugacy. As applications we obtain new answers to a problem first considered by J. F. Plante,…

An $\alpha$-thin tree $T$ of a graph $G$ is a spanning tree such that every cut of $G$ has at most an $\alpha$ proportion of its edges in $T$. The Thin Tree Conjecture proposes that there exists a function $f$ such that for any $\alpha >…

Constructing a spanning tree of a graph is one of the most basic tasks in graph theory. Motivated by several recent studies of local graph algorithms, we consider the following variant of this problem. Let G be a connected bounded-degree…