Publications

Rich mathematical structures arise when algebraic topology meets graph theory, in the framework of discrete cubical homology of graphs. Unlike the conventional approach that models graphs as 1-dimensional simplicial complexes, discrete cubical homology permits the study of higher-dimensional analogues of spheres within a purely discrete setting. Despite the discrete nature of graphs, the computation of these homology groups—even for graphs of modest size—poses significant theoretical as well as algorithmic challenges. My research investigates the computational and combinatorial properties of discrete cubical homology for graphs.

Peer-reviewed publications

On the vanishing of codegree-1 homology cycles in quasimonophobic graphs
Samira Sahar Jamil
(in preparation)
Homology theories for hypergraphs
Syed Hadi Ali Zaidi and Samira Sahar Jamil
(in preparation)
Monophobic neighborhoods of cubes
Curtis Greene and Samira Sahar Jamil
(in preparation)
Quasimonophobic graphs and degree spectral sequences in discrete cubical homology
Samira Sahar Jamil and Mark Behrens
Preprint, arXiv, 2026.
Computability of digital cubical singular homology of c_1-digital images
Samira Sahar Jamil, P. Christopher Staecker, and Danish Ali
Preprint, arXiv, 2022.
Digital Hurewicz theorem and digital homology theory
Samira Sahar Jamil and Danish Ali
Published in Turkish Journal of Mathematics, Vol. 44(3), pp. 739–759, 2020.
DOI: 10.3906/mat-2002-52
Available on arXiv.

Page updated

Google Sites

Report abuse