1. Home
    2. Journals
    3. Proceedings – Mathematical Sciences
    4. Volume 120
    5. Issue 1

    • On the Complexity of Labeled Oriented Trees

      Stephan Rosebrock

      Volume 120 Issue 1 February 2010 pp 11-18

    • Fulltext

       

        Click here to view fulltext PDF


      Permanent link:
      https://www.ias.ac.in/article/fulltext/pmsc/120/01/0011-0018

    • Keywords

       

      Asphericity; 2-complexes; complexity; labeled oriented trees.

    • Abstract

       

      We define a notion of complexity for labeled oriented trees (LOTs) related to the bridge number in knot theory and prove that LOTs of complexity 2 are aspherical. We also present a class of LOTs of higher complexity which is aspherical, give an upper bound for the complexity of labeled oriented intervals and study the complexity of torus knots.

    • Author Affiliations

       

      Stephan Rosebrock1

      1. University of Education, Postfach 11 10 62, 76060 Karlsruhe, Germany

    • Dates

       
      Published
      February 2010
      Manuscript received
      17 October 2008
      Manuscript revised
      29 September 2009

  • Proceedings – Mathematical Sciences | News

    • Editorial Note on Continuous Article Publication

      Posted on July 25, 2019

      Click here for Editorial Note on CAP Mode

© 2022-2023 Indian Academy of Sciences, Bengaluru.

Contact | Site index