Related papers: Strong accessibility of Coxeter groups over minima…

Let (G,S) be a finitely generated Coxeter group, such that the Coxeter system is indecomposable and the canonical bilinear form is indefinite but non-degenerate. We show that the reduced C-*-algebra of G is simple with unique normalised…

A Coxeter system is an ordered pair (W,S) where S is the generating set in a particular type of presentation for the Coxeter group W. A subgroup of W is called special if it is generated by a subset of S. Amalgamated product decompositions…

We prove an accessibility theorem for finite-index splittings of groups. Given a finitely presented group G there is a number n(G) such that, for every reduced locally finite G-tree T with finitely generated stabilizers, T/G has at most…

We show that all groups in a very large class of Coxeter groups are locally quasiconvex and have uniform membership problem solvable in quadratic time. If a group in the class satisfies a further hypothesis it is subgroup separable and…

We classify the groups quasi-isometric to a group generated by finite-order elements within the class of one-ended hyperbolic groups which are not Fuchsian and whose JSJ decomposition over two-ended subgroups does not contain rigid vertex…

The idea of "JSJ-decompositions" for 3-manifolds began with work of Waldhausen and was developed later through work of Jaco, Shalen and Johansen. It was shown that there is a finite collection of 2-sided, incompressible tori that separate a…

Let W be an irreducible finitely generated Coxeter group. The geometric representation of W in GL(V) provides a discrete embedding in the orthogonal group of the Tits form (the associated bilinear form of the Coxeter group). If the Tits…

For a group $H$ and a non empty subset $\Gamma\subseteq H$, the commuting graph $G=\mathcal{C}(H,\Gamma)$ is the graph with $\Gamma$ as the node set and where any $x,y \in \Gamma$ are joined by an edge if $x$ and $y$ commute in $H$. We…

Let $G$ be a reductive algebraic group---possibly non-connected---over a field $k$ and let $H$ be a subgroup of $G$. If $G= GL_n$ then there is a degeneration process for obtaining from $H$ a completely reducible subgroup $H'$ of $G$; one…

We use geometry of Davis complex of a Coxeter group to prove the following result: if G is an infinite indecomposable Coxeter group and $H\subset G$ is a finite index reflection subgroup then the rank of H is not less than the rank of G.…

We give explicit necessary and sufficient conditions for the abstract commensurability of certain families of 1-ended, hyperbolic groups, namely right-angled Coxeter groups defined by generalized theta-graphs and cycles of generalized…

We prove that a connected, locally finite, quasi-transitive graph which is quasi-isometric to a planar graph is necessarily accessible. This leads to a complete classification of the finitely generated groups which are quasi-isometric to…

A hierarchy of a group is a rooted tree of groups obtained by iteratively passing to vertex groups of graphs of groups decompositions. We define a (relative) slender JSJ hierarchy for (almost) finitely presented groups and show that it is…

We prove an acylindrical accessibility theorem for finitely generated groups acting on $\mathbf R$-trees. Namely, we show that if $G$ is a freely indecomposable non-cyclic $k$-generated group acting minimally and $M$-acylindrically on an…

We show that if $H$ is an almost normal subgroup of $G$ such that both $H$ and $G$ are of type $VFP$ and vcd($G$) = vcd($H$) + 1, then $G$ is the fundamental group of a graph of groups in which all vertex and edge groups are commensurable…

We study the minimal length elements in some double cosets of Coxeter groups and use them to study Lusztig's $G$-stable pieces and the generalization of $G$-stable pieces introduced by Lu and Yakimov. We also use them to study the minimal…

Finite semisimple group algebras for which all the minimal ideals are easily computable dimension (ECD) are characterized and some lower bounds for the minimum Hamming distance of group codes in these algebras are offered. Examples…

Say that a finite group $G$ is mixable if a product of random elements, each chosen independently from two options, can distribute uniformly on $G$. We present conditions and obstructions to mixability. We show that $2$-groups, the…

We introduce graphical complexes of groups, which can be thought of as a generalisation of Coxeter systems with 1-dimensional nerves. We show that these complexes are strictly developable, and we equip the resulting Basic Construction with…

A right-angled Coxeter group is a group with a given set of generators of order two, subject only to the relations that certain pairs of the generators commute. Various papers have shown how homological properties of the Coxeter group are…