Related papers: Word problem and parabolic subgroups in Dyer group…

The word problem is an old and central problem in (computational) group theory. It is well-known that the word problem is undecidable in general, but decidable for specific types of presentations. Consistent polycyclic presentations are an…

We show that, in an Artin-Tits group of spherical type, the intersection of two parabolic subgroups is a parabolic subgroup. Moreover, we show that the set of parabolic subgroups forms a lattice with respect to inclusion. This extends to…

We study subsets of groups and monoids defined by language-theoretic means, generalizing the classical approach to the word problem. We expand on results by Herbst from 1991 to a more general setting, and for a class of languages…

We construct and study polyhedral product models for classifying spaces of right-angled Artin and Coxeter groups, general graph product groups and their commutator subgroups. By way of application, we give a criterion of freeness for the…

For a finite Coxeter group, a subword complex is a simplicial complex associated with a pair (Q, \pi), where Q is a word in the alphabet of simple reflections, $\pi$ is a group element. We discuss the transformations of such a complex…

We classify the Artin groups that admit retractions onto all of their parabolic subgroups. Our approach relies on a detailed analysis of triangular subgroups, with a key ingredient being the classification of homomorphisms between dihedral…

In this note, we give a new proof of a result of Matthew Dyer stating that in an arbitrary Coxeter group $W$, every pair $t,t'$ of distinct reflections lie in a unique maximal dihedral reflection subgroup of $W$. Our proof only relies on…

For any right-angled Artin group, we show that its outer automorphism group contains either a finite-index nilpotent subgroup or a nonabelian free subgroup. This is a weak Tits alternative theorem. We find a criterion on the defining graph…

We show that the word problem for any 3-manifold group is solvable in time $O(n\log^3 n)$. Our main contribution is the proof that the word problem for admissible graphs of groups, in the sense of Croke and Kleiner, is solvable in $O(n\log…

We give upper and lower bounds on the conformal dimension of the Bowditch boundary of a Coxeter group with defining graph a complete graph and edge labels at least three. The lower bounds are obtained by quasi-isometrically embedding…

In this paper we introduce a class of `parabolic' subgroups for the generalized braid group associated to an arbitrary irreducible complex reflection group, which maps onto the collection of parabolic subgroups of the reflection group.…

We investigate representations of Coxeter groups into $\mathrm{GL}(n,\mathbb{R})$ as geometric reflection groups which are convex cocompact in the projective space $\mathbb{P}(\mathbb{R}^n)$. We characterize which Coxeter groups admit such…

We prove the following results: (1) There is a one-relator inverse monoid $\mathrm{Inv}\langle A\:|\:w=1 \rangle$ with undecidable word problem; and (2) There are one-relator groups with undecidable submonoid membership problem. The first…

Oshima's Lemma describes the orbits of parabolic subgroups of irreducible finite Weyl groups on crystallographic root systems. This note generalises that result to all root systems of finite Coxeter groups, and provides a self contained…

Using Cohen's classification of symplectic reflection groups, we prove that the parabolic subgroups, that is, stabilizer subgroups, of a finite symplectic reflection group are themselves symplectic reflection groups. This is the symplectic…

Artin groups are a natural generalization of braid groups and are well-understood in certain cases. Artin groups are closely related to Coxeter groups. There is a faithful representation of a Coxeter group $W$ as a linear reflection group…

The 1973 Boone-Higman conjecture predicts that every finitely generated group with solvable word problem embeds in a finitely presented simple group. In this paper, we show that hyperbolic groups satisfy this conjecture, that is, each…

Given a function defined over a parabolic subgroup of a Coxeter group, equidistributed with the length, we give a procedure to construct a function over the entire group, equidistributed with the length. Such a procedure permits to define…

The weak order is a classical poset structure on a Coxeter group; it is a lattice when the group is finite but merely a meet-semilattice when the group is infinite. Motivated by problems in Kazhdan--Lusztig theory, Matthew Dyer introduced…

We study a family of groups consisting of the simplest extensions of lamplighter groups. We use these groups to answer multiple open questions in combinatorial group theory, providing groups that exhibit various combinations of properties:…