2000 character limit reached
Conjugation-invariant norms on the commutator subgroup of the infinite braid group (1605.02306v1)
Published 8 May 2016 in math.GT and math.GR
Abstract: In this paper, we give a proof of the result of Brandenbursky and K\c{e}dra which says that the commutator subgroup of the infinite braid group admits stably unbounded norms. Moreover, we observe the norms which we constructed are equivalent to the biinvariant word norm studied by Brandenbursky and K\c{e}dra.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Collections
Sign up for free to add this paper to one or more collections.