Papers › Betti Numbers of Prodsimplicial Complexes for Directed Graphs with Applications to...
Betti Numbers of Prodsimplicial Complexes for Directed Graphs with Applications to Word Reductions
Lina Fajardo Gómez, Margherita Maria Ferrari, Nataša Jonoska, Masahico Saito
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
We propose custom made cell complexes, in particular prodsimplicial complexes, in order to analyze data consisting of directed graphs. These are constructed by attaching cells that are products of simplices and are suited to study data of acyclic directed graphs, called here consistently directed graphs. We investigate possible values of the first and second Betti numbers and the types of cycles that generate nontrivial homology. We apply these tools to directed graphs associated with reductions of double occurrence words, words that are associated with DNA recombination processes in certain species of ciliates. We study the effects of word operations on the homology for these graphs.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections