Now showing items 1-4 of 4

    • IconA fast algorithm to compute cohomology group generators of orientable 2-manifolds  [Article]

      Dlotko, Pawel (Universidad de Sevilla, 2010)
      In this paper a fast algorithm to compute cohomology group generators of cellular decomposition of any orientable closed 2-manifold is presented. The presented algorithm is a dual version of algorithm to compute homology ...
    • IconComputing Fundamental Group via Forman’s Discrete Morse Theory Extended abstract  [Article]

      Brendel, Piotr; Dlotko, Pawel; Ellis, Graham; Juda, Mateusz; Mrozek, Marian (Universidad de Sevilla, 2015)
      We present research in progress on the algorithmic computation of the fundamental group of a CW complex. We use the algorithm to compute certain algebraic invariants of the fundamental group of the complement of a knot. ...
    • IconComputing The Cubical Cohomology Ring (Extended Abstract)  [Article]

      Kaczynski, Tomasz; Dlotko, Pawel; Mrozek, Marian (Universidad de Sevilla, 2010)
      The goal of this work is to establish a new algorithm for computing the cohomology ring of cubical complexes. The cubical structure enables an explicit recurrence formula for the cup product. We derive this formula and, ...
    • IconThe efficiency of a homology algorithm based on discrete morse theory and coreductions (extended abstract)  [Article]

      Harker, Shaun; Mischaikow, Konstantin; Mrozek, Marian; Nanda, Vidit; Wagner, Hubert; Juda, Mateusz; Dlotko, Pawel (Universidad de Sevilla, 2010)
      Two implementations of a homology algorithm based on the Forman’s discrete Morse theory combined with the coreduction method are presented. Their efficiency is compared with other implementations of homology algorithms.