Related papers: Self-simulability of graph products
A regular bipartite graph $\Gamma$ is called semisymmetric if its full automorphism group $\mathrm{Aut}(\Gamma)$ acts transitively on the edge set but not on the vertex set. For a subgroup $G$ of $\mathrm{Aut}(\Gamma)$ that stabilizes the…
We study amenability of affine algebras (based on the notion of almost-invariant finite-dimensional subspace), and apply it to algebras associated with finitely generated groups. We show that a group G is amenable if and only if its group…
A group is said to be strongly amenable if each of its proximal topological actions has a fixed point. We show that a finitely generated group is strongly amenable if and only if it is virtually nilpotent. More generally, a countable…
We study actions of finitely generated groups on $\bbR$-trees under some stability hypotheses. We prove that either the group splits over some controlled subgroup (fixing an arc in particular), or the action can be obtained by gluing…
We study a family of positive weighted well-covered graphs, which we call levelable graphs, that are related to a construction of level artinian rings in commutative algebra. A graph $G$ is levelable if there exists a weight function with…
We show that the outer automorphism groups of graph products of finitely generated abelian groups satisfy the Tits alternative, are residually finite, their so-called Torelli subgroups are finitely generated, and they satisfy a dichotomy…
There is a procedure, due to Dani and Levcovitz, for taking a finite simplicial graph (\Gamma) and a subgraph (\Lambda) of its complement, checking some conditions, and, if satisfied, producing a graph (\Delta) such that the right-angled…
A result of Baumslag and Roseblade states that a finitely presented subgroup of the direct product of two free groups is virtually a direct product of free groups. In this paper we generalise this result to the class of cyclic subgroup…
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…
We study dismantling properties of the arc, disc and sphere graphs. We prove that any finite subgroup H of the mapping class group of a surface with punctures, the handlebody group, or Out(F_n) fixes a filling (resp. simple) clique in the…
We study Artin kernels, i.e. kernels of discrete characters of right-angled Artin groups, and we show that they decompose as graphs of groups in a way that can be explicitly computed from the underlying graph. When the underlying graph is…
Stackability for finitely presented groups consists of a dynamical system that iteratively moves paths into a maximal tree in the Cayley graph. Combining with formal language theoretic restrictions yields auto- or algorithmic stackability,…
In this paper we introduce the graph $\Gamma_{sc}(G)$ associated with a group $G$, called the solvable conjugacy class graph (abbreviated as SCC-graph), whose vertices are the nontrivial conjugacy classes of $G$ and two distinct conjugacy…
We introduce the normalising graph of a group and study the connectivity of the normalising and permuting graphs of a group when the group is finite and soluble. In particular, we classify finite soluble groups with disconnected normalising…
A directed graph is semi-transitive if and only if it is acyclic and for any directed path $u_1\rightarrow u_2\rightarrow \cdots \rightarrow u_t$, $t \geq 2$, either there is no edge from $u_1$ to $u_t$ or all edges $u_i\rightarrow u_j$…
Let $A$ be an Artin group. A partition $\mathcal{P}$ of the set of standard generators of $A$ is called admissible if, for all $X,Y \in \mathcal{P}$, $X \neq Y$, there is at most one pair $(s,t) \in X \times Y$ which has a relation. An…
In this paper we study the hyperbolicity properties of a class of random groups arising as graph products associated to random graphs. Recall, that the construction of a graph product is a generalization of the constructions of right-angled…
We give a complete characterisation of when the right-angled Artin group on one cycle graph can be quasiisometrically embedded in the right-angled Artin group on another cycle graph. In particular, we find infinitely many instances of…
We prove that an irreducible lattice in a semisimple algebraic group is virtually isomorphic to an arithmetic lattice if and only if it admits a faithful self-similar action on a rooted tree of finite valency.
We give a necessary and sufficient condition for a graph to have a right-angled Artin group as its braid group for braid index $\ge 5$. In order to have the necessity part, graphs are organized into small classes so that one of homological…