SearcharxivSearch

arXiv · 2010.03162

Representations of flat virtual braids which do not preserve the forbidden relations

Abstract

In the paper, we construct a representation $\theta:FVB_n\to{\rm Aut}(F_{2n})$ of the flat virtual braid group $FVB_n$ on $n$ strands by automorphisms of the free group $F_{2n}$ with $2n$ generators which does not preserve the forbidden relations in the flat virtual braid group. This representation gives a positive answer to the problem formulated by V. Bardakov in the list of unsolved problems in virtual knot theory and combinatorial knot theory by R. Fenn, D. Ilyutko, L. Kauffman and V. Manturov. Using this representation we construct a new group invariant for flat welded links. Also we find the set of normal generators of the groups $VP_n\cap H_n$ in $VB_n$, $FVP_n\cap FH_n$ in $FVB_n$, $GVP_n\cap GH_n$ in $GVB_n$, which play an important role in the study of the kernel of the representation $\theta$.

Explore related subjects

Keep this discovery

BibTeXRIS

V. Bardakov, B. Chuzhinov, I. Emel'yanenkov, M. Ivanov, E. Markhinina, T. Nasybullov, S. Panov, N. Singh, S. Vasyutkin, V. Yakhin, A. Vesnin. 2020-10-07. Representations of flat virtual braids which do not preserve the forbidden relations. https://arxiv.org/abs/2010.03162

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

Reversibility and its asymptotic counting in Picard group

We investigate reversible elements in the Picard modular group $\mathrm{PSL}(2,\mathbb{Z}[i])$. We show that reversibility coincides with strong reversibility for Kleinian groups, in particular for the Picard group. We classify reversible elements in the Picard group and characterize loxodromic reversible elements up to conjugacy. We prove that each such conjugacy class contains exactly eight special representatives. We also obtain asymptotic estimates for the number of reversible conjugacy classes with bounded trace.

math.GR

Conjugator length in finitely generated groups

We describe all functions $\mathbb{N}\rightarrow \mathbb{N}$ that can be realized, up to the standard equivalence, as conjugator length functions of finitely generated groups. Furthermore, we show that any two increasing functions $f,g\colon \mathbb N\to \mathbb N$ can be simultaneously realized as conjugator length functions of finitely generated, commensurable (in particular, quasi-isometric) groups.

math.GR

The spectrum of conjugator length functions

A recent program tries to find which functions appear as conjugator length functions. In this note, we show that any (computable) increasing function larger than $n$ appears as $\mathrm{Cl}_G$ for some finitely generated (recursively presented) group. On the other hand, we demonstrate that either $\mathrm{Cl}_G$ must be constant or $\mathrm{Cl}_G(n)\succ n$. Combining these, we obtain a complete description of which functions appear as conjugator length functions of finitely generated groups.

math.GR