Related papers: Improving an algorithm to solve Multiple Simultane…
Machine learning and pattern recognition techniques have been successfully applied to algorithmic problems in free groups. In this paper, we seek to extend these techniques to finitely presented non-free groups, with a particular emphasis…
The cycling operation endows the super summit set $S_x$ of any element $x$ of a Garside group $G$ with the structure of a directed graph $\Gamma_x$. We establish that the subset $U_x$ of $S_x$ consisting of the circuits of $\Gamma_x$ can be…
Guba and Sapir asked if the simultaneous conjugacy problem was solvable in Diagram Groups or, at least, for Thompson's group F. We give a solution to the latter question using elementary techniques which rely purely on the description of F…
We propose new provable practical deterministic polynomial time algorithm for the braid Wang, Xu, Li, Lin and Wang Double shielded public key cryptosystems. We show that a linear decomposition attack based on the decomposition method…
Since the braid group was discovered by E. Artin, the question of its conjugacy problem has been solved by Garside and Birman, Ko and Lee. However, the solutions given thus far are difficult to compute with a computer, since the number of…
One of the most interesting questions about a group is if its word problem can be solved and how. The word problem in the braid group is of particular interest to topologists, algebraists and geometers, and is the target of intensive…
Given a system of equations in a "random" finitely generated subgroup of the braid group, we show how to find a small ordered list of elements in the subgroup, which contains a solution to the equations with a significant probability.…
We propose self-similar contracting groups as a platform for cryptographic schemes based on simultaneous conjugacy search problem (SCSP). The class of these groups contains extraordinary examples like Grigorchuk group, which is known to be…
Recently, several public key exchange protocols based on symbolic computation in non-commutative (semi)groups were proposed as a more efficient alternative to well established protocols based on numeric computation. Notably, the protocols…
We show thatthe double reversing algorithm proposed by dehornoy for solving the word problem in the braid group can also be used to recognize the conjugates of powers of the generators in an Artin group of spherical type. The proof uses a…
The word problem of a group is a very important question. The word problem in the braid group is of particular interest for topologists, algebraists and geometers. In previouse article we have looked at the braid group from a 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…
The transitive simultaneous conjugacy problem asks whether there exists a permutation $\tau \in S_n$ such that $b_j = \tau^{-1} a_j \tau$ holds for all $j = 1,2, \ldots, d$, where $a_1, a_2, \ldots, a_d$ and $b_1, b_2, \ldots, b_d$ are…
An element in Artin's braid group B_n is said to be periodic if some power of it lies in the center of B_n. In this paper we prove that all previously known algorithms for solving the conjugacy search problem in B_n are exponential in the…
We construct new non-associative key establishment protocols for all left self-distributive (LD), multi-LD-, and mutual LD-systems. The hardness of these protocols relies on variations of the (simultaneous) iterated LD-problem and its…
We give a new method to compute the centralizer of an element in Artin braid groups and, more generally, in Garside groups. This method, together with the solution of the conugacy problem given by the authors in a previous paper, are two…
Several key agreement protocols are based on the following "Generalized Conjugacy Search Problem": Find, given elements b_1,...,b_n and xb_1x^{-1},...,xb_nx^{-1} in a nonabelian group G, the conjugator x. In the case of subgroups of the…
This paper presents the first generic bi-objective binary linear branch-and-cut algorithm. Studying the impact of valid inequalities in solution and objective spaces, two cutting frameworks are proposed. The multi-point separation problem…
In this article, we propose the approach to procedural optimization of a neural network, based on the combination of information theory and braid theory. The network studied in the article implemented with the intersections between the…
The maximum labelled clique problem is a variant of the maximum clique problem where edges in the graph are given labels, and we are not allowed to use more than a certain number of distinct labels in a solution. We introduce a new…