Related papers: A conjecture about Artin-Tits groups

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…

Motivated by problems in topology, we explore the complexity of balanced group presentations. We obtain large lower bounds on the complexity of Andrews-Curtis trivialisations, beginning in rank 4. Our results are based on a new…

In this paper we provide an alternative solution to a result by Juh\'{a}sz that the twisted conjugacy problem for odd dihedral Artin groups is solvable, that is, groups with presentation $G(m) = \langle a,b \; | \; _{m}(a,b) = {}_{m}(b,a)…

We give a new proof of Quillen's conjecture for solvable groups via a geometric and explicit method. For p-solvable groups, we provide both a new proof using the Classification of Finite Simple Groups and an asymptotic version without…

Inspired by a recent paper due to Jos\'{e} Luis Garc\'{i}a, we revisit the attempt of Daniel Simson to construct a counterexample to the pure semisimplicity conjecture. Using compactness, we show that the existence of such counterexample…

An even Artin group is a group which has a presentation with relations of the form $(st)^n=(ts)^n$ with $n\ge 1$. With a group $G$ we associate a Lie $\mathbb Z$-algebra $\mathcal{TG}r(G)$. This is the usual Lie algebra defined from the…

We prove that, for a finitely generated group hyperbolic relative to virtually abelian subgroups, the generalised word problem for a parabolic subgroup is the language of a real-time Turing machine. Then, for a hyperbolic group, we show…

The well known Andrews-Curtis Conjecture [2] is still open. In this paper, we establish its finite version by describing precisely the connected components of the Andrews-Curtis graphs of finite groups. This finite version has independent…

We study the problem of realizing families of subgroups as the set of stabilizers of configurations from a subshift of finite type (SFT). This problem generalizes both the existence of strongly and weakly aperiodic SFTs. We show that a…

We define the notion of preGarside group slightly lightening the definition of Garside group so that all Artin-Tits groups are preGarside groups. This paper intends to give a first basic study on these groups. Firstly, we introduce the…

The Atiyah conjecture for a discrete group G states that the $L^2$-Betti numbers of a finite CW-complex with fundamental group G are integers if G is torsion-free and are rational with denominators determined by the finite subgroups of G in…

A conjecture of Boone and Higman from the 1970's asserts that a finitely generated group $G$ has solvable word problem if and only if $G$ can be embedded into a finitely presented simple group. We comment on the history of this conjecture…

The result of this paper is the determination of the cohomology of Artin groups of type A_n, B_n and \tilde{A}_{n} with non-trivial local coefficients. The main result is an explicit computation of the cohomology of the Artin group of type…

Twisted right-angled Artin groups are defined through presentation based on mixed graphs. Each vertex corresponds to a generator, each undirected edge yields a commuting relation and each directed edge gives a Klein bottle relation. If…

In this short note we prove that a class of Artin groups of affine and complex types are virtually poly-free, answering partially the question if all Artin groups are virtually poly-free.

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 characterize when (and how) a Right-Angled Artin group splits nontrivially over an abelian subgroup.

We provide an algorithm to solve the word problem in all fundamental groups of closed 3-manifolds; in particular, we show that these groups are autostackable. This provides a common framework for a solution to the word problem in any closed…

We prove that the compressed word problem in a group that is hyperbolic relative to a collection of free abelian subgroups is solvable in polynomial time.

Given a semisimple group over a local field of residual characteristic p, its topological group of rational points admits maximal pro-p-subgroups. Quasi-split simply-connected semisimple groups can be described in the combinatorial terms of…