Related papers: Graphical complexes of groups

Let $C(L)$ be the right-angled Coxeter group defined by an abstract triangulation $L$ of $\mathbb{S}^2$. We show that $C(L)$ is isomorphic to a hyperbolic right-angled reflection group if and only if $L$ can be realized as an acute…

The recently introduced A-homotopy groups for graphs are investigated. The main concern of the present article is the construction of an infinite cell complex, the homotopy groups of which are isomorphic to the A-homotopy groups of the…

We define the $k$-cut complex of a graph $G$ with vertex set $V(G)$ to be the simplicial complex whose facets are the complements of sets of size $k$ in $V(G)$ inducing disconnected subgraphs of $G$. This generalizes the Alexander dual of a…

To any finite graph $X$ (viewed as a topological space) we assosiate some explicit compact metric space ${\cal X}^r(X)$ which we call {\it the reflection tree of graphs $X$}. This space is of topological dimension $\le1$ and its connected…

In this article we generalize the theory of subgroup graphs of subgroups of free groups to finite index subgroups $H$ of finitely generated groups $G$. We study and prove various properties of $H$ in relation to its subgroup graph…

Let G be a finite group. Denoting by cd(G) the set of degrees of the irreducible complex characters of G, we consider the character degree graph of G: this is the (simple undirected) graph whose vertices are the prime divisors of the…

We give a simple construction of Gromov hyperbolic Coxeter groups of arbitrarily large virtual cohomological dimension. Our construction provides new examples of such groups. Using this one can construct e.g. new groups having some…

Various simplicial complexes can be associated with a graph. Box complexes form an important families of such simplicial complexes and are especially useful for providing lower bounds on the chromatic number of the graph via some of their…

We give an elementary criterion on a group G for the map from Aut(G) to Out(G) to split virtually. This criterion applies to many residually finite CAT(0) groups and hyperbolic groups, and in particular to all finitely generated Coxeter…

We exhibit a variety of groups that act properly and even cocompactly on median graphs (a.k.a. one-skeletons of CAT(0) cube complexes), with quasi-isometric groups that do not admit any proper action on a median graph. This answes a…

The notion of regular cell complexes plays a central role in topological combinatorics because of its close relationship with posets. A generalization, called totally normal cellular stratified spaces, was introduced by the third author by…

Multilevel self-assembly involving small structured groups of nano-particles provides new routes to development of functional materials with a sophisticated architecture. Apart from the inter-particle forces, the geometrical shapes and…

Autostackability for finitely generated groups is defined via a topological property of the associated Cayley graph which can be encoded in a finite state automaton. Autostackable groups have solvable word problem and an effective inductive…

Similarity notions between vertices in a graph, such as structural and regular equivalence, are one of the main ingredients in clustering tools in complex network science. We generalise structural and regular equivalences for undirected…

Let $\Gamma$ be a connected, triangle-free, planar graph with at least five vertices that has no separating vertices or edges. If the graph $\Gamma$ is $\mathcal{CFS}$, we prove that the right-angled Coxeter group $G_\Gamma$ is virtually a…

We introduce topological invariants of semi-decompositions (e.g. filtrations, semi-group actions, multi-valued dynamical systems, combinatorial dynamical systems) on a topological space to analyze semi-decompositions from a dynamical…

Let G be a group acting geometrically on a CAT(0) cube complex X. We prove first that G is hyperbolic relative to the collection P of subgroups if and only if the simplicial boundary of X is the disjoint union of a nonempty discrete set,…

Given a class of groups C, a group G is strongly accessible over C if there is a bound on the number of terms in a sequence L(1), L(2), ..., L(n) of graph of groups decompositions of G with edge groups in C such that L(1) is the trivial…

If $\mathcal C$ is a class of complexes closed under taking full subcomplexes and covers and $\mathcal G$ is the class of groups admitting proper and cocompact actions on one-connected complexes in $\mathcal C$, then $\mathcal G$ is closed…

We prove a number of results having to do with equipping type-I $\mathrm{C}^*$-algebras with compact quantum group structures, the two main ones being that such a compact quantum group is necessarily co-amenable, and that if the…