Now showing items 1-20 of 35

    • Icon

      A geometric characterization of the upper bound for the span of the Jones polynomial  [Article]

      González-Meneses López, Juan; González Manchón, Pedro María (World Scientific, 2011-07)
      Let D be a link diagram with n crossings, sA and sB its extreme states and |sAD| (resp. |sBD|) the number of simple closed curves that appear when smoothing D according to sA (resp. sB). We give a general formula for the ...
    • Icon

      A geometric description of the extreme Khovanov cohomology  [Article]

      González-Meneses López, Juan; González Manchón, Pedro María; Silvero Casanova, Marithania (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 ...
    • Icon

      Basic results on braid groups  [Article]

      González-Meneses López, Juan (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 ...
    • Icon

      Bi-orderings on pure braided Thompson's groups  [Article]

      Burillo Puig, José; González-Meneses López, Juan (2008-03)
      In this paper it is proved that the pure braided Thompson’s group BF admits a bi-order, analog to the bi-order of the pure braid groups.
    • Icon

      Closures of positive braids and the Morton-Franks-Williams inequality  [Article]

      González-Meneses López, Juan; González Manchón, Pedro María (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 ...
    • Icon

      Computation of centralizers in braid groups and Garside groups  [Article]

      Gonçalves Soares Franco, Nuno María; González-Meneses López, Juan (Consejo Superior de Investigaciones Científicas, 2003)
      We give a new method to compute the centralizer of an element in Artin braid groups and, more generally, in Garside groups. This method, together with the solution of the conjugacy problem given by the authors in [9] ...
    • Icon

      Conjugacy in Garside groups I: Cyclings, powers, and rigidity  [Article]

      Birman, Joan S.; Gebhardt, Volker; González-Meneses López, Juan (European Mathematical Society, 2007)
      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 ...
    • Icon

      Conjugacy in Garside groups II: Structure of the ultra summit set  [Article]

      Birman, Joan S.; Gebhardt, Volker; González-Meneses López, Juan (European Mathematical Society, 2008)
      This paper is the second in a series in which the authors study the conjugacy decision problem (CDP) and the conjugacy search problem (CSP) in Garside groups. The ultra summit set USS(X) of an element X in a Garside group ...
    • Icon

      Conjugacy in Garside Groups III: Periodic braids  [Article]

      Birman, Joan S.; Gebhardt, Volker; González-Meneses López, Juan (Elsevier, 2007-10-15)
      An element in Artin’s braid group Bn is said to be periodic if some power of it lies in the center of Bn. In this paper we prove that all previously known algorithms for solving the conjugacy search problem in Bn are ...
    • Icon

      Conjugacy problem for braid groups and Garside groups  [Article]

      Gonçalves Soares Franco, Nuno María; González-Meneses López, Juan (Elsevier, 2003-08-01)
      We present a new algorithm to solve the conjugacy problem in Artin braid groups, which is faster than the one presented by Birman, Ko and Lee. This algorithm can be applied not only to braid groups, but to all Garside ...
    • Icon

      Generating random braids  [Article]

      Gebhardt, Volker; González-Meneses López, Juan (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 ...
    • Icon

      Geometric approaches to braid groups and mapping class groups  [Article]

      González-Meneses López, Juan (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 ...
    • Icon

      Geometric embeddings of braid groups do not merge conjugacy classes  [Article]

      González-Meneses López, Juan (Sociedad Matemática Mexicana, 2014-10)
      An embedding of the m-times punctured disc into the n-times punctured disc, for n > m, yields an embedding of the braid group on m strands Bm into the braid group on n strands Bn, called a geometric embedding. The main ...
    • Icon

      Homología de Khovanov  [Final Degree Work]

      Rivera Bustos, Ana Alicia (2018-09)
      Knot theory is quite younger compare to other theories in mathematics. Even so, it is an important mathematic theory in the topology field. Besides, it seems to have relation with other fields of knowledge like biology or ...
    • Icon

      Improving an algorithm to solve multiple simultaneous conjugacy problems in braid groups  [Article]

      González-Meneses López, Juan (American Mathematical Society, 2005)
      There are recent cryptographic protocols that are based on Multiple Simultaneous Conjugacy Problems in braid groups. We improve an algorithm, due to Sang Jin Lee and Eonkyung Lee, to solve these problems, by applying a ...
    • Icon

      New presentations of surface braid groups  [Article]

      González-Meneses López, Juan (World Scientific Publishing, 2001)
      In this paper we give new presentations of the braid groups and the pure braid groups of a closed surface. We also give an algorithm to solve the word problem in these groups, using the given presentations.
    • Icon

      On reduction curves and Garside properties of braids  [Article]

      González-Meneses López, Juan (American Mathematical Society, 2011)
      In this paper we study the reduction curves of a braid, and how they can be used to decompose the braid into simpler ones in a precise way, which does not correspond exactly to the decomposition given by Thurston theory. ...
    • Icon

      On some families of links and new approaches to link homologies  [PhD Thesis]

      Silvero Casanova, Marithania (2016-03-01)
      Esta tesis se enmarca dentro de la Teoría de Nudos. En los Capítulos 1 y 2 se usan herramientas clásicas para estudiar las propiedades de ciertas familias de enlaces y las relaciones de inclusión entre ellas. En los Capítulos ...
    • Icon

      On the centralizer of generic braids  [Article]

      González-Meneses López, Juan; Valladares García, Dolores (De Gruyter, 2018-11)
      We study the centralizer of a braid from the point of view of Garside theory, showing that generically a minimal set of generators can be computed very efficiently, as the ultra summit set of a generic braid has a very ...
    • Icon

      On the cycling operation in braid groups  [Article]

      González-Meneses López, Juan; Gebhardt, Volker (Elsevier, 2008-09-06)
      The cycling operation is a special kind of conjugation that can be applied to elements in Artin’s braid groups, in order to reduce their length. It is a key ingredient of the usual solutions to the conjugacy problem in ...