Related papers: Identifying Half-Twists Using Randomized Algorithm…
Using totally symmetric sets, Chudnovsky, Kordek, Li, and Partin gave a superexponential lower bound on the cardinality of non-abelian finite quotients of the braid group. In this paper, we develop new techniques using multiple totally…
We present a solution to the conjugacy decision problem and the conjugacy search problem in Garside groups, which is theoretically simpler than the usual one, with no loss of efficiency. This is done by replacing the well known cycling and…
In this article, we give a numerical algorithm to compute braid groups of curves, hyperplane arrangements, and parameterized system of polynomial equations. Our main result is an algorithm that determines the cross-locus and the generators…
Let $G$ be a semisimple algebraic group. We develop a machinery for manipulation and manufacture of well-rounded families $\left\{ \mathcal{B}_{T}\right\} _{T>0}\subset G$ as they were defined in a work by A. Gorodnik and A. Nevo. The…
According to the Tits conjecture proved by Crisp and Paris, [CP], the subgroups of the braid group generated by proper powers of the Artin elements are presented by the commutators of generators which are powers of commuting elements. Hence…
Twisted knot theory, introduced by M.O. Bourgoin, is a generalization of virtual knot theory. It naturally yields the notion of a twisted braid, which is closely related to the notion of a virtual braid due to Kauffman. In this paper, we…
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…
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…
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.
We solve the isomorphism problem for braid groups on trees with $n = 4$ or 5 strands. We do so in three main steps, each of which is interesting in its own right. First, we establish some tools and terminology for dealing with computations…
In this paper we study topological invariants of a class of random groups. Namely, we study right angled Artin groups associated to random graphs and investigate their Betti numbers, cohomological dimension and topological complexity. The…
Knot theory is an active field of mathematics, in which combinatorial and computational methods play an important role. One side of computational knot theory, that has gained interest in recent years, both for complexity analysis and…
In the 1920's Artin defined the braid group in an attempt to understand knots in a more algebraic setting. A braid is a certain arrangement of strings in three-dimensional space. It is a celebrated theorem of Alexander that every knot is…
We consider semigroup algorithmic problems in finitely generated metabelian groups. Our paper focuses on three decision problems introduced by Choffrut and Karhum\"{a}ki (2005): the Identity Problem (does a semigroup contain a neutral…
We initiate a general approach to the relative braid group symmetries on (universal) $\imath$quantum groups, arising from quantum symmetric pairs of arbitrary finite types, and their modules. Our approach is built on new intertwining…
We investigate a group $B\_\bullet$ that includes Artin's braid group $B\_\infty$ and Thompson's group $F$. The elements of $B\_\bullet$ are represented by braids diagrams in which the distances between the strands are not uniform and,…
The $k$-truss, introduced by Cohen (2005), is a graph where every edge is incident to at least $k$ triangles. This is a relaxation of the clique. It has proved to be a useful tool in identifying cohesive subnetworks in a variety of…
We study geometric presentations of braid groups for particles that are constrained to move on a graph, i.e. a network consisting of nodes and edges. Our proposed set of generators consists of exchanges of pairs of particles on junctions of…
In his initial paper on braids E.Artin gave a presentation with two generators for an arbitrary braid group. We give analogues of this Artin's presentation for various generalizations of braids.
Random number generators are widely used in practical algorithms. Examples include simulation, number theory (primality testing and integer factorization), fault tolerance, routing, cryptography, optimization by simulated annealing, and…