2015•DalSpace (Dalhousie University)Requires access

On the combinatorics of resolutions of monomial ideals

Nursel Erey

Open publisher page 0 citations

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.

About this research paper

What this paper is about

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.

Why it matters

A significance statement is not available in the OpenAlex record.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available 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.

Key concepts: Betti number, Monomial, Mathematics, Simplicial complex, Monomial ideal, Combinatorics, Simplicial homology, Graph

Related papers

Back to paper searchBrowse research topicsOriginal source
On the combinatorics of resolutions of monomial ideals — Research Paper | ScholarLens