Searcharxiv⌕ Search
Home/Archive/arXiv

arXiv · math/0106007

Identifying Half-Twists Using Randomized Algorithm Methods

S. Kaplan·M. Teicher
View original source ↗Read source document ↗Export metadata ↓

Abstract

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 operations needed is extremely large. Meanwhile, random algorithms used to solve difficult problems such as primality of a number were developed, and the random practical methods have become an important tool. We give a random algorithm, along with a conjecture of how to improve its convergence speed, in order to identify elements in the braid group, which are conjugated to its generators for a given power. These elements of the braid group, the half-twists, are important in themselves, as they are the key players in some geometrical and algebraical methods, the building blocks of quasipositive braids and they construct endless sets of generators for the group.

Explore related subjects

math.AGmath.AT

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

S. Kaplan, M. Teicher. 2002-10-08. Identifying Half-Twists Using Randomized Algorithm Methods. https://arxiv.org/abs/math/0106007

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

arXiv2026

Wall divisors on irreducible symplectic orbifolds of Nikulin-type

We determine the wall divisors on irreducible symplectic orbifolds which are deformation equivalent to a special type of examples, called Nikulin orbifolds. The Nikulin orbifolds are obtained as partial resolutions in codimension 2 of a quotient by a symplectic involution of a Hilbert scheme of 2 points on a K3 surface. This builds on the previous article arXiv:2009.04873 in which the theory of wall divisors was generalized to orbifold singularities.

math.AG↗
arXiv2026

Prekosmic Grothendieck/Galois Categories

We establish a generalized version of the duality between groups and the categories of their representations on sets. Given an abstract symmetric monoidal category $K$ called Galois prekosmos, we define pre-Galois objects in $K$ and study the categories of their representations internal to $K$. The motivating example of $K$ is the cartesian monoidal category $\textit{Set}$ of sets, and pre-Galois objects in $\textit{Set}$ are groups. We present an axiomatic definition of pre-Galois $K$-categories, which is a complete abstract characterization of the categories of representations of pre-Galois objects in $K$. The category of covering spaces over a well-connected topological space is a prototype of a pre-Galois $\textit{Set}$-category. We establish a perfect correspondence between pre-Galois objects in $K$ and pre-Galois $K$-categories pointed with pre-fiber functors. We also establish a generalized version of the duality between flat affine group schemes and the categories of their linear representations. Given an abstract symmetric monoidal category $K$ called Grothendieck prekosmos, we define what are pre-Grothendieck objects in $K$ and study the categories of their representations internal to $K$. The motivating example of $K$ is the symmetric monoidal category $\textit{Vec}_k$ of vector spaces over a field $k$, and pre-Grothendieck objects in $\textit{Vec}_k$ are affine group $k$-schemes. We present an axiomatic definition of pre-Grothendieck $K$-categories, which is a complete abstract characterization of the categories of representations of pre-Grothendieck objects in $K$. The indization of a neutral Tannakian category over a field $k$ is a prototype of a pre-Grothendieck $\textit{Vec}_k$-category. We establish a perfect correspondence between pre-Grothendieck objects in $K$ and pre-Grothendieck $K$-categories pointed with pre-fiber functors.

math.AG↗