Buscar
Mostrando ítems 1-10 de 16
Artículo
Geometric approaches to braid groups and mapping class groups
(Cellule Mathdoc, 2015)
These are Lecture Notes of a course given by the author at the School Winter Braids, held at the Université de Pau et des Pays de L’Adour (France), on February 2015. It is explained how mapping class groups, and in particular ...
Artículo
A geometric description of the extreme Khovanov cohomology
(Cambridge University Press, 2018-06)
We prove that the hypothetical extreme Khovanov cohomology of a link is the cohomology of the independence simplicial complex of its Lando graph. We also provide a family of knots having as many non-trivial extreme Khovanov ...
Artículo
Twisted conjugacy in braid groups
(Springer, 2014)
In this note we solve the twisted conjugacy problem for braid groups, i.e. we propose an algorithm which, given two braids u, v ∈ Bn and an automorphism ϕ ∈ Aut(Bn), decides whether v = (ϕ(x))−1ux for some x ∈ Bn. As a ...
Tesis Doctoral
Sous-groupes paraboliques et généricité dans les groupes d'Artin-Tits de type sphérique.
(2018-09-03)
En la primera parte de esta tesis estudiamos la conjetura de genericidad: En el grafo de Cayley del mapping class group de una superficie cerrada, consideramos una bola de radio suficientemente grande centrada en el elemento ...
Artículo
The root extraction problem for generic braids
(MDPI, 2019-10)
We show that, generically, finding the k-th root of a braid is very fast. More precisely, we provide an algorithm which, given a braid x on n strands and canonical length l, and an integer k > 1, computes a k-th root of ...
Artículo
Basic results on braid groups
(Université Blaise Pascal, 2011)
These are Lecture Notes of a course given by the author at the French-Spanish School Tresses in Pau, held in Pau (France) in October 2009. It is basically an introduction to distinct approaches and techniques that can be ...
Artículo
The cyclic sliding operation in Garside groups
(Springer, 2010-05)
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 ...
Artículo
Solving the conjugacy problem in Garside groups by cyclic sliding
(Elsevier, 2010-06)
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 ...
Artículo
Closures of positive braids and the Morton-Franks-Williams inequality
(Elsevier, 2014-09-01)
We study the Morton-Franks-Williams inequality for closures of simple braids (also known as positive permutation braids). This allows to prove, in a simple way, that the set of simple braids is a orthonormal basis for the ...
Artículo
Generating random braids
(Elsevier, 2013-01)
We present an algorithm to generate positive braids of a given length as words in Artin generators with a uniform probability. The complexity of this algorithm is polynomial in the number of strands and in the length of ...