Explicit Boij-Söderberg theory of ideals from a graph isomorphism reduction
From MaRDI portal
Publication:2184790
Abstract: In the origins of complexity theory Booth and Lueker showed that the question of whether two graphs are isomorphic or not can be reduced to the special case of chordal graphs. To prove that, they defined a transformation from graphs G to chordal graphs BL(G). The projective resolutions of the associated edge ideals is manageable and we investigate to what extent their Betti tables also tell non-isomorphic graphs apart. It turns out that the coefficients describing the decompositions of Betti tables into pure diagrams in Boij-Soderberg theory are much more explicit than the Betti tables themselves, and they are expressed in terms of classical statistics of the graph G.
Recommendations
Cites work
- Algebraic properties of edge ideals via combinatorial topology
- Anti-lecture hall compositions
- Betti diagrams from graphs
- Betti numbers of graded modules and cohomology of vector bundles
- Boij-Söderberg theory: introduction and survey
- Graded Betti numbers of Cohen-Macaulay modules and the multiplicity conjecture
- scientific article; zbMATH DE number 3679885 (Why is no real title available?)
- scientific article; zbMATH DE number 16165 (Why is no real title available?)
- scientific article; zbMATH DE number 3473265 (Why is no real title available?)
- scientific article; zbMATH DE number 482758 (Why is no real title available?)
- Monomial ideals, edge ideals of hypergraphs, and their graded Betti numbers
- The mathematics of lecture hall partitions
- Triangulations of polygons and stacked simplicial complexes: separating their Stanley-Reisner ideals
This page was built for publication: Explicit Boij-Söderberg theory of ideals from a graph isomorphism reduction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2184790)