Some Remarks on the Braided Thompson Group BV
Kai-Uwe Bux, Dmitriy Sonkin

TL;DR
This paper explores properties of the braided Thompson group BV, highlighting its potential for cryptography and demonstrating that it does not have non-trivial linear representations.
Contribution
It provides new insights into the algebraic properties of BV, especially its resistance to linear representations, which is relevant for cryptographic applications.
Findings
BV does not admit a non-trivial linear representation
Highlights potential cryptographic relevance of BV
Provides analysis of algebraic properties of BV
Abstract
Matthew Brin and Patrick Dehornoy independently discovered a braided version BV of Thompson's group V. In this paper, we discuss some properties of BV that might make the group interesting for group based cryptography. In particular, we show that BV does not admit a non-trivial linear representation.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsGeometric and Algebraic Topology · Coding theory and cryptography · semigroups and automata theory
