Computation of the minimal basis of the first (co)homology group on combinatorial 2-manifolds

11 maggio 2016
Versione stampabile

Luogo: Dipartimento di Matematica, via Sommarive, 14 - Povo (TN) - Aula Seminari
Ore 14:30


  • Ruben Specogna (Università di Udine, Dip. Politecnico di Ingegneria ed Architettura)


We first review linear worst-case complexity algorithms for the computation of the first homology and cohomology group generators on closed combinatorial 2-manifolds. Then, we show how to generalize these algorithms to work with combinatorial 2-manifolds with boundary and to compute a basis of the first relative (co)homology group. Finally, these ingredients are used to devise a greedy algorithm to compute the minimal basis of the aforementioned (co)homology groups.

This is the first one of a short series of seminars on "Computational Homology and  Applications in Electromagnetism" that Prof. Ruben Specogna will hold during his research stay at the Department of Mathematics of the University of Trento.

Referenti: Ana Alonso and Riccardo Ghiloni