Related papers: Computation of Centralizers in Braid groups and Ga…

We construct two families of representations of the braid group $B_n$ by considering conjugation actions on congruence subgroups of $GL_{n-1}(Z[t^{\pm 1},q^{\pm 1}])$. We show that many of these representations are faithful modulo the…

Centraliser algebras of monomial representations of finite groups may be constructed and studied using methods similar to those employed in the study of permutation groups. Guided by results of D. G. Higman and others, we give an explicit…

This paper introduces a novel and general algorithm for approximately counting the number of orbits under group actions. The method is based on combining the Burnside process and importance sampling. Specializing to unitriangular groups…

We give a unified solution to the conjugacy problem for Thompson's groups F, T, and V. The solution uses strand diagrams, which are similar in spirit to braids and generalize tree-pair diagrams for elements of Thompson's groups. Strand…

We determine all finite subgroups of simple algebraic groups that have irreducible centralizers - that is, centralizers whose connected component does not lie in a parabolic subgroup.

We describe the relation between two characterizations of conjugacy in groups of piecewise-linear homeomorphisms, discovered by Brin and Squier in [2] and Kassabov and Matucci in [5]. Thanks to the interplay between the techniques, we…

This thesis takes Brady's construction of $K(\pi,1)$s for the braid groups as a starting point. It is widely known that this construction can - with the right ingredients - be generalized to Artin groups of finite type. Results of Bessis as…

How far can the elementary description of centralizers of parabolic subalgebras of Hecke algebras of finite real reflection groups be generalized to the complex reflection group case? In this paper we begin to answer this question by…

This paper is the first of a two part series devoted to describing relations between congruence and crystallographic braid groups. We recall and introduce some elements belonging to congruence braid groups and we establish some…

We found Groebner-Shirshov basis for the braid semigroup $B^+_{n+1}$. It gives a new algorithm for the solution of the word problem for the braid semigroup and so for the braid group.

We describe new combinatorial methods for constructing an explicit free resolution of Z by ZG-modules when G is a group of fractions of a monoid where enough least common multiples exist (``locally Gaussian monoid''), and, therefore, for…

We give a systematic exposition of memory-length algorithms for solving equations in noncommutative groups. This exposition clarifies some points untouched in earlier expositions. We then focus on the main ingredient in these attacks:…

Poly-free groups are constructed as iterated semidirect products of free groups. The class of poly-free groups includes the classical pure braid groups, fundamental groups of fiber-type hyperplane arrangements, and certain subgroups of the…

Higher braiding gates, a new kind of quantum gate, are introduced. These are matrix solutions of the polyadic braid equations (which differ from the generalized Yang-Baxter equations). Such gates support a special kind of multi-qubit…

We give deterministic polynomial-time algorithms that, given an order, compute the primitive idempotents and determine a set of generators for the group of roots of unity in the order. Also, we show that the discrete logarithm problem in…

We study an efficient algorithm to hash any single qubit gate (or unitary matrix) into a braid of Fibonacci anyons represented by a product of icosahedral group elements. By representing the group elements by braid segments of different…

We use the classical interpretation of the braid group $B_3$ as a central extension of the modular group $\text{PSL}_2\left(\mathbb{Z}\right)$ to establish new and fundamental properties of $B_3$ using the theory of continued fractions. In…

We propose a new algorithm solving the extended gcd problem, which provides a solution minimizing one of the two coordinates. The algorithm relies on elementary arithmetic properties.

Let n be greater than or equal to 3. We study the quotient group B\_n/[P n,P\_n] of the Artin braid group B\_n by the commutator subgroup of its pure Artin braid group P\_n. We show that B\_n/[P n,P\_n] is a crystallographic group, and in…

We study braided Hochschild and cyclic homology of ribbon algebras in braided monoidal categories, as introduced by Baez and by Akrami and Majid. We compute this invariant for several examples coming from quantum groups and braided groups.