2018/10/23 by Alexander Engström, Engstrom, Alexander, Laura Jakobsson +3
Computer Science · Mathematics · #Topological and Geometric Data Analysis #Commutative Algebra and Its Applications #Computational Drug Discovery Methods
paper · pdf · doi:10.48550/arxiv.1810.10055
In the origins of complexity theory Booth and Lueker showed that the question\nof whether two graphs are isomorphic or not can be reduced to the special case\nof chordal graphs. To prove that, they defined a transformation from graphs G\nto chordal graphs BL(G). The projective resolutions of the associated edge\nideals is manageable and we investigate to what extent their Betti tables also\ntell non-isomorphic graphs apart. It turns out that the coefficients describing\nthe decompositions of Betti tables into pure diagrams in Boij-Soderberg theory\nare much more explicit than the Betti tables themselves, and they are expressed\nin terms of classical statistics of the graph G.\n