相关论文: Computation of Centralizers in Braid groups and Ga…
We propose a new cryptosystem based on polycyclic groups. The cryptosystem is based on the fact that the word problem can be solved effectively in polycyclic groups, while the known solutions to the conjugacy problem are far less efficient.
We provide a general formula for Mueger's centralizer of any fusion subcategory of a braided fusion category containing a tannakian subcategory. This entails a description for Mueger's centralizer of all fusion subcategories of a group…
In this paper we construct a gathering process by the means of which we obtain new normal forms in braid groups. The new normal forms generalise Artin-Markoff normal forms and possess an extremely natural geometric description. In the two…
We describe a constructive, cubic time solution to the conjugacy problem in Artin groups of extra-large type, which was proved solvable in those groups by Appel and Schupp. We use results from two of our previous papers that characterise…
We solve the simultaneous conjugacy problem in Artin's braid groups and, more generally, in Garside groups, by means of a complete, effectively computable, finite invariant. This invariant generalizes the one-dimensional notion of super…
We study several natural decision problems in braid groups and Artin groups. We classify the Artin groups with decidable submonoid membership problem in terms of the non-existence of certain forbidden induced subgraphs of the defining…
Let $\mathscr{C}$ be a classical group defined over a finite field. We present comprehensive theoretical solutions to the following closely related problems: 1) List a representative for each conjugacy class of $\mathscr{C}$. 2) Given $x…
We show that reducible braids which are, in a Garside-theoretical sense, as simple as possible within their conjugacy class, are also as simple as possible in a geometric sense. More precisely, if a braid belongs to a certain subset of its…
We provide algorithms for performing computations in generalized numerical semigroups, that is, submonoids of $\mathbb{N}^{d}$ with finite complement in $\mathbb{N}^{d}$. These semigroups are affine semigroups, which in particular implies…
In this paper we give new presentations of the braid groups and the pure braid groups of a closed surface. We also give an algorithm to solve the word problem in these groups, using the given presentations.
In this paper we propose right-angled Artin groups as a platform for secret sharing schemes based on the efficiency (linear time) of the word problem. Inspired by previous work of Grigoriev-Shpilrain in the context of graphs, we define two…
In this paper we consider several classical and novel algorithmic problems for right-angled Artin groups, some of which are closely related to graph theoretic problems, and study their computational complexity. We study these problems with…
We consider the topological complexity of subgroups of Artin's braid group consisting of braids whose associated permutations lie in some specified subgroup of the symmetric group. We give upper and lower bounds for the topological…
In this note we solve the twisted conjugacy problem for braid groups, i.e. we propose an algorithm which, given two braids $u,v\in B_n$ and an automorphism $\phi \in Aut (B_n)$, decides whether $v=(\phi (x))^{-1}ux$ for some $x\in B_n$. As…
We analyse the complexity of constructing involution centralisers in unitary groups over fields of odd order. In particular, we prove logarithmic bounds on the number of random elements required to generate a subgroup of the centraliser of…
This paper is the second in a series in which the authors study the conjugacy decision problem (CDP) and the conjugacy search problem (CSP) in Garside groups. The ultra summit set USS(X) of an element X in a Garside group G is a finite set…
Let $G$ be an algebraic group of type $G_2$ over a field $k$ of characteristic $\neq 2,3$. In this paper we calculate centralizers of semisimple elements in anisotropic $G_2$. Using these, we show explicitly that there are six conjugacy…
Define a Garside monoid to be a cancellative monoid where right and left lcm's exist and that satisfy additional finiteness assumptions, and a Garside group to be the group of fractions of a Garside monoid. The family of Garside groups…
We give characterizations of the center, of conjugated and of commuting elements in a fundamental group of a graph of group. We deduce various results : on the one hand we give a sufficient condition for the center, the centralizers, and…
The root extraction problem in braid groups is the following: given a braid $\beta \in \mathcal{B}_n$ and a number $k\in \mathbb{N}$, find $\alpha\in \mathcal{B}_n$ such that $\alpha^k=\beta$. In the last decades, many cryptosystems such as…