Related papers: Distinguishing virtual braids in polynomial time
In this note, we give an algorithm that computes the linearwidth of input $n$-vertex graphs in time $O^*(2^n)$, which improves a trivial $O^*(2^m)$-time algorithm, where $n$ and $m$ the number of vertices and edges, respectively.
We suggest a new algorithm for finding a canonical representative of a given braid, and also for the harder problem of finding a $\sigma_1$-consistent representative. We conjecture that the algorithm is quadratic-time. We present numerical…
We show a simple and easily implementable solution to the word problem for virtual braid groups.
Let VB$_n$ be the virtual braid group on $n$ strands and let $\mathfrak{S}_n$ be the symmetric group on $n$ letters. Let $n,m \in \mathbb{N}$ such that $n \ge 5$, $m \ge 2$ and $n \ge m$. We determine all possible homomorphisms from VB$_n$…
We give a polynomial time reduction from vector scheduling problem (VS) to generalized load balancing problem (GLB). This reduction gives the first non-trivial online algorithm for VS where vectors come in an online fashion. The online…
We propose an algorithm for deciding whether a given braid is pseudo-Anosov, reducible, or periodic. The algorithm is based on Garside's weighted decomposition and is polynomial-time in the word-length of an input braid. Moreover, a…
The main result of the paper is the first polynomial-time algorithm for ranking bracelets. The time-complexity of the algorithm is O(k^2 n^4), where k is the size of the alphabet and n is the length of the considered bracelets. The key part…
In this note, we consider the problem of counting and verifying abelian border arrays of binary words. We show that the number of valid abelian border arrays of length \(n\) is \(2^{n-1}\). We also show that verifying whether a given array…
We study the structure of the virtual braid group. It is shown that the virtual braid group is a semi--direct product of the virtual pure braid group and the symmetric group. Also, it is shown that the virtual pure braid group is a…
The virtual singular braid group arises as a natural common generalization of classical singular braid groups and virtual braid groups. In this paper, we study several algebraic properties of the virtual singular braid group $VSG_n$. We…
In the present paper we study structural aspects of certain quotients of braid groups and virtual braid groups. In particular, we construct and study linear representations $B_n\to {\rm GL}_{n(n-1)/2}\left(\mathbb{Z}[t^{\pm1}]\right)$,…
We give an algorithm to decide whether a given braid with four strings is a product of three factors which are conjugates of standard generators of the braid group. The algorithm is of polynomial time. It is based on the Garside theory. We…
Computing the Jones polynomial of general link diagrams is known to be $\#$P-hard, while restricting the computation to braid closures on fixed number of strands allows for a polynomial time algorithm. We investigate polynomial time…
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…
By exploring simplicial structure of pure virtual braid groups, we give new connections between the homotopy groups of the 3-sphere and the virtual braid groups that are related to the theory of Brunnian virtual braids. The group structure…
In the present paper we give a new method for converting virtual knots and links to virtual braids. Indeed the braiding method given in this paper is quite general, and applies to all the categories in which braiding can be accomplished. We…
Virtual knots arise in the study of Gauss diagrams and Vassiliev invariants of usual knots. Virtual braids correspond naturally to virtual knots. We consider the group of virtual braids on n strings VB_n and its Burau representation, in…
In this paper, we propose a probabilistic algorithm suitable for any linear code $C$ to determine whether a given vector $\mathbf{x}$ belongs to $ C$. The algorithm achieves $O(n\log n)$ time complexity, $ O(n^2)$ space complexity and with…
Virtual braids are a combinatorial generalization of braids. We present abstract braids as equivalence classes of braid diagrams on a surface, joining two distinguished boundary components. They are identified up to isotopy, compatibility,…
We extend the notion of congruence subgroups of the braid group to the virtual braid group using an extension of the integral Burau representation. We prove that the level 2 congruence subgroup of the virtual braid group is the pure virtual…