Related papers: Identifying Half-Twists Using Randomized Algorithm…
In clustering problems, a central decision-maker is given a complete metric graph over vertices and must provide a clustering of vertices that minimizes some objective function. In fair clustering problems, vertices are endowed with a color…
This paper proposes a novel primal heuristic for Mixed Integer Programs, by employing machine learning techniques. Mixed Integer Programming is a general technique for formulating combinatorial optimization problems. Inside a solver, primal…
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…
The orbifold braid groups of two dimensional orbifolds were defined in [1] (arXiv:math/9907194) to understand certain Artin groups as subgroups of some suitable orbifold braid groups. We studied orbifold braid groups in some more detail in…
In the paper we give a survey on braid groups and subjects connected with them. We start with the initial definition, then we give several interpretations as well as several presentations of these groups. Burau presentation for the pure…
We study twisted conjugacy classes of the unit element in different groups. Fel'shtyn and Troitsky showed that the twisted conjugacy class of the unit element of an abelian group is a subgroup for every automorphism. The structure is…
The Standard Model of particle physics provides very accurate predictions of phenomena occurring at the sub-atomic level, but the reason for the choice of symmetry group and the large number of particles considered elementary, is still…
The n-string braid group of a graph X is defined as the fundamental group of the n-point configuration space of the space X. This configuration space is a finite dimensional aspherical space. A. Abrams and R. Ghrist have conjectured that…
The conjugacy problem belongs to algorithmic group theory. It is the following question: given two words x, y over generators of a fixed group G, decide whether x and y are conjugated, i.e., whether there exists some z such that zxz^{-1} =…
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:…
The deep connections between braids and dynamics by way of the Nielsen-Thurston classification theorem have led to a wide range of practical applications. Braids have been used to detect coherent structures and mixing regions in oceanic…
The Drinfled realization of quantum affine algebras has been tremendously useful since its discovery. Combining techniques of Beck and Nakajima with our previous approach, we give a complete and conceptual proof of the Drinfeld realization…
Solving the generalized eigenvalue problem is a useful method for finding energy eigenstates of large quantum systems. It uses projection onto a set of basis states which are typically not orthogonal. One needs to invert a matrix whose…
Presentations are computed for a braided version BV of Thompson's group V and for V itself showing that there is an Artin group/Coxeter group relation between them. The presentation for V is obtained from that for BV by declaring all that…
We develop a theory of localization for braid group representations associated with objects in braided fusion categories and, more generally, to Yang-Baxter operators in monoidal categories. The essential problem is to determine when a…
We give an algorithm which decides the Nielsen-Thurston type of a given four-strand braid. The complexity of our algorithm is quadratic with respect to word length. The proof of its validity is based on a result which states that for a…
We present a new operation to be performed on elements in a Garside group, called cyclic sliding, which is introduced to replace the well known cycling and decycling operations. Cyclic sliding appears to be a more natural choice,…
We show that braided Cherednik algebras introduced by the first two authors are cocycle twists of rational Cherednik algebras of the imprimitive complex reflection groups $G(m,p,n)$, when $m$ is even. This gives a new construction of mystic…
Topological quantum computing is an alternative framework for avoiding the quantum decoherence problem in quantum computation. The problem of executing a gate in this framework can be posed as the problem of braiding quasiparticles. Because…
In this article we survey recent progress in the algorithmic theory of matrix semigroups. The main objective in this area of study is to construct algorithms that decide various properties of finitely generated subsemigroups of an infinite…