Papers
Topics
Authors
Recent
Search
2000 character limit reached

Virtual Artin groups

Published 27 Oct 2021 in math.GR | (2110.14293v1)

Abstract: Starting from the observation that the standard presentation of a virtual braid group mixes the standard presentation of the corresponding braid group with the standard presentation of the corresponding symmetric group and some mixed relations that mimic the action of the symmetric group on its root system, we define a virtual Artin group $VA[\Gamma]$ of a Coxeter graph $\Gamma$ mixing the standard presentation of the Artin group $A[\Gamma]$ with the standard presentation of the Coxeter group $W[\Gamma]$ and some mixed relations that mimic the action of $W[\Gamma]$ on its root system. By definition we have two epimorphisms $\pi_K:VA[\Gamma]\to W[\Gamma]$ and $\pi_P:VA[\Gamma]\to W[\Gamma]$ whose kernels are denoted by $KVA[\Gamma]$ and $PVA[\Gamma]$ respectively. We calculate presentations for these two subgroups. In particular $KVA[\Gamma]$ is an Artin group. We prove that the center of any virtual Artin group is trivial. In the case where $\Gamma$ is of spherical type or of affine type, we show that each free of infinity parabolic subgroup of $KVA[\Gamma]$ is also of spherical type or of affine type, and we show that $VA[\Gamma]$ has a solution to the word problem. In the case where $\Gamma$ is of spherical type we show that $KVA[\Gamma]$ satisfies the $K(\pi,1)$ conjecture and we infer the cohomological dimension of $KVA[\Gamma]$ and the virtual cohomological dimension of $VA[\Gamma]$. In the case where $\Gamma$ is of affine type we determine upper bounds for the cohomological dimension of $KVA[\Gamma]$ and for the virtual cohomological dimension of $VA[\Gamma]$.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.