Related papers: A fast solution to the conjugacy problem in the 4-…
We describe the most efficient solutions to the word problem of Artin's braid group known so far, i.e., in other words, the most efficient solutions to the braid isotopy problem, including the Dynnikov method, which could be especially…
Path planning for multiple tethered robots is a challenging problem due to the complex interactions among the cables and the possibility of severe entanglements. Previous works on this problem either consider idealistic cable models or…
We solve Poisson's equation using new multigrid algorithms that converge rapidly. The novel feature of the 2D and 3D algorithms are the use of extra diagonal grids in the multigrid hierarchy for a much richer and effective communication…
Genetic Programming (GP) has found various applications. Understanding this type of algorithm from a theoretical point of view is a challenging task. The first results on the computational complexity of GP have been obtained for problems…
In this paper, I give a method to calculate the HOMFLY polynomials of knots by using a representation of the braid group B4 into a group of 3 ? 3 matrices. Also, I will give examples of a 2-bridge knot and a 3-bridge knot that have the same…
We design an algorithm writing down presentations of graph braid groups. Generators are represented in terms of actual motions of robots moving without collisions on a given graph. A key ingredient is a new motion planning algorithm whose…
We describe a series of complexes that relate to the braid groups as the matching complexes relate to the symmetric groups. A modified construction applies as well to other complexes based on edge sets in graphs. We show that our…
We prove that fundamental groups of non-orientable 3-manifolds have a solvable conjugacy problem, and construct an algorithm. Together with our earlier work on the conjugacy problem in groups on orientable geometrizable 3-manifolds, all…
We construct cobordisms of small genus between torus knots and use them to determine the cobordism distance between torus knots of small braid index. In fact, the cobordisms we construct arise as the intersection of a smooth algebraic curve…
We study a geometric action on a CAT(0) space of a finite index subgroup of the quotient group of the braid group on 4 strands by its center.
In the last decade the broad scope of complex networks has led to a rapid progress. In this area a particular interest has the study of community structures. The analysis of this type of structure requires the formalization of the intuitive…
Conjugacy is not the only possible primitive for designing braid-based protocols. To illustrate this principle, we describe a Fiat--Shamir-style authentication protocol that be can be implemented using any binary operation that satisfies…
The coalition structure formation problem represents an active research area in multi-agent systems. A coalition structure is defined as a partition of the agents involved in a system into disjoint coalitions. The problem of finding the…
In this paper a relation between iterated cyclings and iterated powers of elements in a Garside group is shown. This yields a characterization of elements in a Garside group having a rigid power, where 'rigid' means that the left normal…
This paper presents a parallel solution based on the coarse-grained multicomputer (CGM) model using the four-splitting technique to solve the optimal binary search tree problem. The well-known sequential algorithm of Knuth solves this…
In their paper `A new algorithm for recognizing the unknot', in Geometry and Topology', 2 (1998) n. 9, 175-220, the first author and Michael Hirsch presented a then new algorithm for recognizing the unknot. The first part of the algorithm…
A fundamental problem in the study of phylogenetic networks is to determine whether or not a given phylogenetic network contains a given phylogenetic tree. We develop a quadratic-time algorithm for this problem for binary nearly-stable…
In this paper we begin the study of set-theoretic type solution of the braid equation. Our theory includes set-theoretical solutions as basic examples. We show that the relationships between set-theoretical solutions, q-cycle sets,…
In this paper we prove that the Conjugacy Problem in the Grigorchuk group $\Gamma$ has polynomial time complexity.
We present the first truly subcubic, combinatorial algorithm for detecting an induced $4$-cycle in a graph. The running time is $O(n^{2.84})$ on $n$-node graphs, thus separating the task of detecting induced $4$-cycles from detecting…