A good leaf order on simplicial trees
Abstract
Using the existence of a good leaf in every simplicial tree, we order the facets of a simplicial tree in order to find combinatorial information about the Betti numbers of its facet ideal. Applications include an Eliahou-Kervaire splitting of the ideal, as well as a refinement of a recursive formula of Hà and Van Tuyl for computing the graded Betti numbers of simplicial trees.
- Publication:
-
arXiv e-prints
- Pub Date:
- July 2013
- DOI:
- 10.48550/arXiv.1307.2190
- arXiv:
- arXiv:1307.2190
- Bibcode:
- 2013arXiv1307.2190F
- Keywords:
-
- Mathematics - Commutative Algebra;
- 13;
- 5
- E-Print:
- 17 pages, to appear