A Good Leaf Order on Simplicial Trees

DOI10.1007/978-1-4939-0626-0_4zbMATH Open1316.13030arXiv1307.2190OpenAlexW2109188858MaRDI QIDQ5261422FDOQ5261422

Sara Faridi

Publication date: 3 July 2015

Published in: Connections Between Algebra, Combinatorics, and Geometry (Search for Journal in Brave)

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`a and Van Tuyl for computing the graded Betti numbers of simplicial trees.

Full work available at URL: https://arxiv.org/abs/1307.2190

Recommendations

• On the ordering of trees by the Laplacian coefficients
• On a certain ordering of the vertices of a tree
• Optimal leaf ordering of complete binary trees
• Ordering trees by the Laplacian coefficients
• Ordering trees by their Laplacian spectral radii
• Ordering trees by the spectral radius of Laplacian
• scientific article
• Ordering trees with fixed order and matching number by Laplacian spectral radius
• scientific article; zbMATH DE number 3269730
• On the ordering of trees by the two indices

Mathematics Subject Classification ID

Trees (05C05) Commutative rings defined by monomial ideals; Stanley-Reisner face rings; simplicial complexes (13F55)

Cited In (3)

• Betti splitting via componentwise linear ideals
• Lattice complements and the subadditivity of syzygies of simplicial forests
• Multigraded Betti numbers of simplicial forests

This page was built for publication: A Good Leaf Order on Simplicial Trees

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5261422)