On the combinatorics of resolutions of monomial ideals
Nursel Erey
Abstract
Nursel Erey
Abstract
In this thesis, we investigate the relation between invariants of minimal free resolutions of monomial ideals and combinatorial properties of simplicial complexes. We provide a sufficient combinatorial condition for monomial ideals to have nonzero Betti numbers and show that such a condition completely characterizes Betti numbers of facet ideals of simplicial forests. We also present a new approach to computing Betti numbers of path ideals of certain graph classes.
A significance statement is not available in the OpenAlex record.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
In this thesis, we investigate the relation between invariants of minimal free resolutions of monomial ideals and combinatorial properties of simplicial complexes. We provide a sufficient combinatorial condition for monomial ideals to have nonzero Betti numbers and show that such a condition completely characterizes Betti numbers of facet ideals of simplicial forests. We also present a new approach to computing Betti numbers of path ideals of certain graph classes.
Key concepts: Betti number, Monomial, Mathematics, Simplicial complex, Monomial ideal, Combinatorics, Simplicial homology, Graph