Becerra, F., Efremov, V. and Hernandez, A. (2014) Block Matrix Representation of a Graph Manifold Linking Matrix Using Continued Fractions. Applied Mathematics, 5, 1894-1902.
http://dx.doi.org/10.4236/am.2014.513183

has been cited by the following article:

• TITLE: Algorithm for Fast Calculation of Hirzebruch-Jung Continued Fraction Expansions to Coding of Graph Manifolds

  AUTHORS: Fernando I. Becerra López, Vladimir N. Efremov, Alfonso M. Hernández Magdaleno

  KEYWORDS: Hirzebruch-Jung Continued Fraction, Fast Expansion Algorithm, Graph Manifolds

  JOURNAL NAME: Applied Mathematics, Vol.6 No.10, September 8, 2015

  ABSTRACT: We present a new algorithm for the fast expansion of rational numbers into continued fractions. This algorithm permits to compute the complete set of integer Euler numbers of the sophisticate tree graph manifolds, which we used to simulate the coupling constant hierarchy for the universe with five fundamental interactions. Moreover, we can explicitly compute the integer Laplacian block matrix associated with any tree plumbing graph. This matrix coincides up to sign with the integer linking matrix (the main topological invariant) of the graph manifold corresponding to the plumbing graph. The need for a special algorithm appeared during computations of these topological invariants of complicated graph manifolds since there emerged a set of special rational numbers (fractions) with huge numerators and denominators; for these rational numbers, the ordinary methods of expansion in continued fraction became unusable.